#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n,m;
vector<int> rednibr;
vector<int> artocki;
vector<vector<int> > v;
int broj=0;
int dfs(int x,int pr,int broj)
{
int minbr=broj;
int granki=0;
int t;
int maxi=0;
rednibr[x]=broj;
for(int i=0;i<v[x].size();i++)
{
if(v[x][i]==pr)
continue;
if(rednibr[v[x][i]])
minbr=min(minbr,rednibr[v[x][i]]);
else
{
int t=dfs(v[x][i],x,broj+1);
minbr=min(minbr,t);
maxi=max(maxi,t);
granki++;
}
}
if(x==0)
{
if(granki>1)
artocki.push_back(x);
}
else
{
if(maxi>=rednibr[x])
artocki.push_back(x);
}
return minbr;
}
int main()
{
cin>>n;
cin>>m;
vector<int> vec;
vector<int> s,e;
v.insert(v.begin(),n+m+4,vec);
int nov=m;
rednibr.insert(rednibr.begin(),n+m+4,0);
for(int i=0;i<m;i++)
{
int a,b;
cin>>a>>b;
a--;
b--;
s.push_back(a);
e.push_back(b);
v[a].push_back(nov);
v[b].push_back(nov);
v[nov].push_back(a);
v[nov].push_back(b);
nov++;
}
dfs(0,-1,1);
sort(artocki.begin(),artocki.end());
for(int i=0;i<artocki.size();i++)
{
if(artocki[i]>=m)
cout<<s[artocki[i]-m]+1<<" "<<e[artocki[i]-m]+1<<endl;
}
cout<<endl;
return 0;
}
/*
9 11
1 2
2 3
3 1
3 4
4 5
5 6
6 4
6 7
7 8
8 9
9 7
*/
Compilation message
pipes.cpp: In function 'int dfs(int, int, int)':
pipes.cpp:17:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<v[x].size();i++)
~^~~~~~~~~~~~
pipes.cpp:14:9: warning: unused variable 't' [-Wunused-variable]
int t;
^
pipes.cpp: In function 'int main()':
pipes.cpp:68:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<artocki.size();i++)
~^~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
6 ms |
1920 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
36 ms |
33836 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
64 ms |
57512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
130 ms |
65536 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
131 ms |
65536 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
55 ms |
65536 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
61 ms |
65536 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
60 ms |
65536 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
60 ms |
65536 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |