# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1003087 | Aiperiii | Pipes (CEOI15_pipes) | C++14 | 1873 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>
//#define int long long
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
const int N=1e5+5;
int p[2][N];
vector <int> g[N];
int find_set(int i,int v){
if(p[i][v]==v)return v;
return p[i][v]=find_set(i,p[i][v]);
}
bool union_set(int i,int u,int v){
if(find_set(i,u)==find_set(i,v))return false;
p[i][u]=v;
return true;
}
int t=0,to;
void dfs(int v,int par){
t++;
p[0][v]=t;
p[1][v]=t;
bool ok=0;
for(int to : g[v]){
if(par==to && !ok)ok=1;
else if(p[0][to])p[1][v]=min(p[1][v],p[0][to]);
else{
dfs(to,v);
# | 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... |