# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
237309 | keta_tsimakuridze | One-Way Streets (CEOI17_oneway) | C++14 | 10 ms | 9728 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;
int n,m,k,u,v,mn[200005],ind[200005],fix[200005],bridge[200005],F[200005],sum[200005],timer,tmin[200005],q;
char ans[200005];
vector<pair<int,pair<int,int> > >V[200005],B[200005];
void dfs(int u){
fix[u]=1;
timer++;
tmin[u]=mn[u]=timer;
for(int i=0;i<V[u].size();i++){
int v=V[u][i].first;
if(fix[v]==0){
dfs(v);
}
mn[u]=min(mn[u],mn[v]);
if(mn[v]>=tmin[u]){
bridge[V[u][i].second.first]=1;
F[v]=1;
F[u]=1;
B[v].push_back({u,{V[u][i].second.first,V[u][i].second.second}});
B[u].push_back({v,{V[u][i].second.first,1-V[u][i].second.second}});
}
}
// cout<<u<<"++"<<mn[u]<<endl;
}
void dfs1(int u,int p){
fix[u]=2;
ind[u]=p;
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... |