# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
300357 | oolimry | Connecting Supertrees (IOI20_supertrees) | C++14 | 272 ms | 26232 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 "supertrees.h"
#include <bits/stdc++.h>
#define all(x) (x).begin() (x).end()
#define sz(x) (int) (x).size()
using namespace std;
typedef vector<vector<int>> vvi;
int n;
vector<vector<int>> die = {{-1}};
struct ufds{
int p[1005];
int n;
void init(int N ){
n = N;
for(int i = 0;i <= n;i++) p[i] = i;
}
int findSet(int u){
if(u == p[u]) return u;
else{
p[u] = findSet(p[u]);
return p[u];
}
}
void unionSet(int u, int v){
u = findSet(u);
v = findSet(v);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |