# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
63155 | khsoo01 | One-Way Streets (CEOI17_oneway) | C++11 | 219 ms | 44988 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 X first
#define Y second
using namespace std;
typedef pair<int,int> pii;
const int N = 100005;
int n, m, q, ans[N], dep[N], p[N], dir[N];
bool vis[N], bc[N];
vector<int> adj[N];
vector<pii> edg;
struct disj {
int par[N];
void init () {iota(par, par+n+1, 0);}
int Find (int X) {
if(par[X] == X) return X;
return par[X] = Find(par[X]);
}
void Union (int A, int B) {
A = Find(A); B = Find(B);
if(A == B) return;
par[A] = B;
}
} uf;
void calc (int C, int P) {
if(vis[C]) return;
vis[C] = true;
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... |