# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
302236 | leejseo | Connecting Supertrees (IOI20_supertrees) | C++17 | 276 ms | 22264 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>
using namespace std;
int N;
vector<vector<int>> ans;
struct DisjointSet{
int par[1005];
DisjointSet(){
for (int i=0; i<1005; i++) par[i] = i;
}
int root(int u){
if (par[u] == u) return u;
return par[u] = root(par[u]);
}
bool chk(int u, int v){
return root(u) == root(v);
}
void merge(int u, int v){
u = root(u); v = root(v);
if (u != v) par[u] = v;
}
} disj, uf;
const bool ST4 = true, ST5 = false;
int construct(vector<vector<int>> p) {
int N = p.size();
for (int i = 0; i < N; i++) {
vector<int> row;
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... |