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 <iostream>
#include <vector>
#define adiyer(); ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
int n, m, timer;
int tin[1001], tout[1001], fup[1001];
vector < int > g[1001];
bool was[1001];
void dfs(int v, int p){
was[v] = 1;
fup[v] = tin[v] = ++timer;
bool c;
for(int u : g[v]){
if(u == p && !c){
c = 1;
continue;
}
if(was[u]){
fup[v] = min(tin[u], fup[v]);
}
else{
dfs(u, v);
fup[v] = min(fup[u], fup[v]);
if(fup[u] > tin[v]){
cout << u << ' ' << v << '\n';
}
}
}
}
int u, v;
int main(){
adiyer();
cin >> n >> m;
for(int i = 1; i <= m; i++) cin >> u >> v, g[v].push_back(u), g[u].push_back(v);
for(int i = 1; i <= n; i++)
if(!was[i])
dfs(i, 0);
}
# | 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... |