# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
425948 | oleh1421 | One-Way Streets (CEOI17_oneway) | C++17 | 255 ms | 31096 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>
typedef long long ll;
using namespace std;
const int N=100010;
const ll mod=1000000007;
const ll inf=1e15;
int a[N],b[N];
int x[N],y[N];
vector<pair<int,int> >g[N];
int timer=0;
int tin[N],tout[N],fup[N];
bool used[N];
bool imp[N];
void dfs(int v,int pr){
used[v]=true;
tin[v]=fup[v]=++timer;
for (auto cur:g[v]){
int to=cur.first;
int ind=cur.second;
if (ind==pr) continue;
if (!used[to]){
dfs(to,ind);
if (fup[to]>tin[v]) imp[ind]=true;
fup[v]=min(fup[v],fup[to]);
} else {
fup[v]=min(fup[v],tin[to]);
}
}
}
int comp[N];
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... |