# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
125859 | wilwxk | Pipes (CEOI15_pipes) | C++14 | 2996 ms | 65540 KiB |
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;
const int MAXN=1e5+5;
vector<int> g[MAXN];
int pre[MAXN], low[MAXN];
int n, m, tempo;
void dfs(int cur, int p) {
pre[cur]=low[cur]=++tempo;
int cont=0;
for(auto viz : g[cur]) {
if(viz==p&&cont==0) {
cont=1; continue;
}
if(!pre[viz]) {
dfs(viz, cur);
low[cur]=min(low[cur], low[viz]);
if(low[viz]==pre[viz]) printf("%d %d\n", cur, viz);
}
low[cur]=min(low[cur], pre[viz]);
}
// printf("%d >> %d %d\n", cur, pre[cur], low[cur]);
}
int main() {
scanf("%d %d", &n, &m);
for(int i=1; i<=m; i++) {
int a, b; scanf("%d %d", &a, &b);
g[a].push_back(b); g[b].push_back(a);
}
for(int i=1; i<=n; i++) if(!pre[i]) dfs(i, i);
}
Compilation message (stderr)
# | 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... |