# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
46974 | dqhungdl | One-Way Streets (CEOI17_oneway) | C++17 | 336 ms | 53416 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;
typedef pair<int,int> ii;
int T,n,m,cnt=0,Time=0,Num[100005],Low[100005],In[100005],Out[100005],Pre[100005],h[100005],P[100005][20];
int sum1[100005],sum2[100005];
bool FEdge[100005];
vector<ii> Edge,gg[100005];
vector<int> g[100005];
void FindBridge(int u,int preid)
{
Num[u]=Low[u]=++cnt;
for(int i=0;i<gg[u].size();i++)
{
int v=gg[u][i].first;
int id=gg[u][i].second;
if(Num[v]==0)
{
FindBridge(v,id);
Low[u]=min(Low[u],Low[v]);
if(Low[v]>=Num[v])
FEdge[id]=true;
}
else
if(id!=preid)
Low[u]=min(Low[u],Num[v]);
}
}
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... |