# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
526644 | Deepesson | Connecting Supertrees (IOI20_supertrees) | C++17 | 219 ms | 24120 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>
#include "supertrees.h"
///void build(std::vector<std::vector<int>> _b);
#define MAX 1005
int pai[MAX][10];
int find(int a,int b){
if(pai[a][b]==a){
return a;
}
return pai[a][b]=find(pai[a][b],b);
}
void Union(int a,int b,int c){
a=find(a,c);
b=find(b,c);
pai[a][c]=b;
}
void ativar(int a,int b,std::vector<std::vector<int>>& ref){
ref[a][b]=ref[b][a]=1;
/// printf("Constroi %d %d\n",a,b);
}
int construct(std::vector<std::vector<int>> p) {
std::vector<std::vector<int>> answer;
int n = p.size();
for (int i = 0; i < n; i++) {
std::vector<int> row;
row.resize(n);
answer.push_back(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... |