# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
161578 | amoo_safar | One-Way Streets (CEOI17_oneway) | C++14 | 354 ms | 41560 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
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef string str;
const ll Mod = 1e9 + 7;
const int Maxn = 2e5 + 100;
ll par[Maxn];
ll get(ll u){
if(u == par[u]) return u;
return par[u] = get(par[u]);
}
void merge(ll u, ll v){
u = get(u); v = get(v);
par[u] = v;
}
vector<pll> G[Maxn];
vector<ll> H[Maxn];
vector< pll > ed, ed2;
ll ans[Maxn];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |