# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1021711 | idiotcomputer | Pipes (CEOI15_pipes) | C++11 | 730 ms | 23528 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.
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2")
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz size
const int mxN = 1e5;
int n,m;
vector<int> adj[mxN];
int p[2*mxN];
void dfs(int c, int depth, int par){
p[c] = depth;
p[c+n] = p[c];
int op = par;
for (int i : adj[c]){
if (i == par){par = -1; continue;}
if (p[i] != -1){ p[c+n] = min(p[c+n],p[i]); continue;}
dfs(i,depth+1,c);
p[c+n] = min(p[c+n], p[i+n]);
}
if (p[c+n] >= depth && op != -1) cout << c+1 << " " << op+1 << '\n';
}
int gpar(const int &c){
if (p[c] == c) return c;
p[c] = gpar(p[c]);
# | 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... |