This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
vector<int> adj[100001];
vector<int> tin(100001,-1),low(100001,-1);
bool vi[100001];
int t=0;
void dfs(int x,int p=-1){
vi[x]=true;
tin[x]=low[x]=t++;
bool cl=false;
for(int u:adj[x]){
if(u==p && !cl){
cl=true;
continue;
}
if(vi[u]){
low[x]=min(low[x],tin[u]);
}else{
dfs(u,x);
low[x]=min(low[x],low[u]);
if(low[u]>tin[x]) cout<<u<<" "<<x<<"\n";
}
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a,b;
cin>>a>>b;
for(int i=0; i<b; i++){
int x,y;
cin>>x>>y;
adj[x].push_back(y);
adj[y].push_back(x);
}
for(int i=1; i<=a; i++){
if(!vi[i]) dfs(i);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |