# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
162299 | karma | One-Way Streets (CEOI17_oneway) | C++14 | 138 ms | 28184 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 emplace_back
#define ll long long
#define fi first
#define se second
#define mp make_pair
using namespace std;
const int N = int(2e5) + 7;
typedef pair<int, int> pii;
struct TEdge{int u, v; bool del;} e[N];
int low[N], num[N], Time = 0, br[N], lab[N], cnt = 0;
vector<int> ver, a[N];
vector<pii> g[N];
int n, m, u, v, q, c[N], f[N], vis[N];
string s;
void DFS(int u) {
low[u] = num[u] = ++Time;
for(int i: a[u]) {
if(e[i].del) continue;
e[i].del = 1;
int v = e[i].u ^ e[i].v ^ u;
if(!num[v]) {
int cur = ver.size();
DFS(v);
low[u] = min(low[u], low[v]);
if(low[v] >= 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... |