# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
237403 | keta_tsimakuridze | One-Way Streets (CEOI17_oneway) | C++14 | 401 ms | 36856 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[100005],ind[100005],fix[100005],bridge[100005],F[100005],sum[100005],timer,tmin[100005],q;
char ans[100005];
vector<pair<int,pair<int,int> > >V[100005],B[100005];
map<int,int>FX[100005];
void dfs(int u,int p) {
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(v==p) continue;
if(fix[v]==0) {
dfs(v,u);
mn[u]=min(mn[u],mn[v]);
if(mn[v]>tmin[u] && FX[v][u]==1) {
bridge[V[u][i].second.first]=1;
F[v]=1;
F[u]=1;
}
} else mn[u]=min(mn[u],tmin[v]);
}
// cout<<u<<"++"<<mn[u]<<endl;
}
void dfs1(int u,int p,int nm) {
if(nm==1)fix[u]=2;
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... |