# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
199361 | nvmdava | One-Way Streets (CEOI17_oneway) | C++17 | 487 ms | 57336 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;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long
#define ff first
#define ss second
#define N 100005
#define MOD 1000000007
vector<int> adj[N];
int v[N], u[N];
int dsu[N];
int dep[N], low[N];
int ans[N];
int find(int x){
return x == dsu[x] ? x : dsu[x] = find(dsu[x]);
}
void merge(int a, int b){
dsu[find(a)] = find(b);
}
int proc[N];
void dfs(int v, int p){
++proc[v];
low[v] = dep[v] = dep[::v[p] ^ ::u[p] ^ v] + 1;
for(auto& x : adj[v]){
if(x == p) continue;
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... |