# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
51831 | istlemin | One-Way Streets (CEOI17_oneway) | C++14 | 1905 ms | 113964 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;
#define rep(i,a,b) for(int i = a; i<int(b);++i)
#define all(v) v.begin(),v.end()
#define sz(v) v.size()
#define trav(a,c) for(auto a: c)
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pii;
class UnionFind {
public:
vi p;
vi r;
UnionFind(ll n){
p.resize(n);
r.resize(n,1);
rep(i,0,n) p[i] = i;
}
ll find(ll v){
return p[v]==v?v:p[v]=find(p[v]);
}
void join(ll a,ll b){
a = find(a); b = find(b);
if(r[a]>r[b]) p[b] = a;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |