# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
244451 | dantoh000 | Pipes (CEOI15_pipes) | C++14 | 2679 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;
typedef pair<int,int> ii;
int n,m;
vector<int> G[100005];
int num[100005];
int p[100005];
int low[100005];
int ct = 1;
int root;
map< ii , int> M;
void dfs(int u){
low[u] = num[u] = ct++;
for (auto v : G[u]){
if (num[v] == 0){
p[v] = u;
dfs(v);
if (low[v] > num[u]){
M[ii(u,v)]++;
}
low[u] = min(low[u],low[v]);
}
else if (v != p[u]){
low[u] = min(low[u],num[v]);
}
}
}
int main(){
scanf("%d%d",&n,&m);
for (int i = 0; i < m; i++){
int u,v;
scanf("%d%d",&u,&v);
G[u].push_back(v);
G[v].push_back(u);
}
for (int i = 1; i <= n; i++){
if (num[i] == 0){
dfs(i);
}
}
for (auto x : M){
if (x.second == 1){
printf("%d %d\n",x.first.first,x.first.second);
}
}
}
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... |