# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
92956 | Kastanda | One-Way Streets (CEOI17_oneway) | C++11 | 241 ms | 29816 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>
#define pb push_back
using namespace std;
const int N = 100005, LG = 18;
int n, m, q, from[N], to[N], M[N], H[N], Mn[N];
int cp, Hc[N], C[N], P[N][LG], up[N], dn[N];
int qa[N], qb[N];
char R[N];
vector < int > Adj[N], Ad[N];
void DFS(int v, int p)
{
Mn[v] = H[v]; M[v] = 1;
for (int &id : Adj[v])
{
if (id == p)
continue;
int u = from[id] ^ to[id] ^ v;
if (M[u] == 2)
continue;
else if (M[u] == 1)
Mn[v] = min(Mn[v], H[u]);
else
{
H[u] = H[v] + 1;
DFS(u, id);
Mn[v] = min(Mn[v], Mn[u]);
}
}
M[v] = 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... |