# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1050578 | Alihan_8 | Roller Coaster Railroad (IOI16_railroad) | C++17 | 169 ms | 27700 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 "railroad.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) x.begin(), x.end()
#define ln '\n'
#define ar array
using i64 = long long;
struct Dsu{
vector <int> fa;
Dsu(int n){
fa.resize(n);
iota(all(fa), 0);
}
int get(int x){
return x ^ fa[x] ? fa[x] = get(fa[x]) : x;
}
bool merge(int u, int v){
u = get(u), v = get(v);
if ( u == v ) return false;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |