# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116684 | fleimgruber | Pipes (CEOI15_pipes) | C++17 | 3643 ms | 65536 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;
//bridge finding
const int MAX_N = 100005;
int n,t,in[MAX_N];
vector<int> e[MAX_N];
int dfs(int i, int p = -1)
{
in[i] = t++;
int lo = in[i];
for (int g : e[i])
{
if (g == p)
{
p = -1;
continue;
}
if (in[g])
lo = min(lo,in[g]);
else
{
int lg = dfs(g,i);
if (lg > in[i])
printf("%d %d\n",i,g);
lo = min(lo,lg);
}
}
return lo;
}
void bridges()
{
t = 1;
for (int i=1; i<=n; i++)
if (!in[i])
dfs(i);
}
//-----
int main()
{
int m,a,b;
scanf("%d %d",&n,&m);
//TODO simplify graph
while (m--)
{
scanf("%d %d",&a,&b);
e[a].push_back(b);
e[b].push_back(a);
}
bridges();
return 0;
}
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... |