# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
573606 | rc_catunta | Connecting Supertrees (IOI20_supertrees) | C++14 | 195 ms | 24108 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;
vector<int> padre,rnk,tam;
void init(int n){
padre.assign(n,0);
rnk.assign(n,1);
tam.assign(n,1);
for(int i=0;i<n;i++){
padre[i]=i; // Es su propio padre
}
}
int buscar(int x){
if(padre[x]==x) return x;
else return padre[x]=buscar(padre[x]);
}
bool mismo_conjunto(int a,int b){
return buscar(a)==buscar(b);
}
void unir(int a,int b){
if(!mismo_conjunto(a,b)){
a = buscar(a);
b = buscar(b);
if(rnk[a]>=rnk[b]){
// B se una a A
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... |