# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
211114 | arnold518 | One-Way Streets (CEOI17_oneway) | C++14 | 8 ms | 4992 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 long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1e5;
int N, M, P;
pii E[MAXN+10];
vector<pii> adj[MAXN+10], adj2[MAXN+10];
int ans[MAXN+10];
char S[5]="!BRL";
int dfn[MAXN+10], low[MAXN+10], cnt;
void dfs(int now, int bef)
{
dfn[now]=low[now]=++cnt;
for(auto nxt : adj[now])
{
if(nxt.second==bef) continue;
if(dfn[nxt.first]==0)
{
dfs(nxt.first, nxt.second);
low[now]=min(low[now], low[nxt.first]);
if(low[nxt.first]<=dfn[now]) ans[nxt.second]=1;
}
else
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... |