# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
315575 | tigicha | Connecting Supertrees (IOI20_supertrees) | C++14 | 1088 ms | 30220 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 par[1005], ar[1005], a[1005][1005], ans[1005][1005], fix1[1005], n, fix[1005];
vector<int>vec1[1005], vec[1005], v1;
vector<vector<int> >answer;
int parent(int x){
if(par[x]==x) return x;
return par[x]=parent(par[x]);
}
void dsu(int x, int y){
x=parent(x);
y=parent(y);
if(x==y) return;
if(ar[x]<ar[y]) swap(x, y);
par[y]=x;
ar[x]+=ar[y];
}
void rec(int z){
for(int i=0; i<vec1[z].size(); i++)
for(int j=i+1; j<vec1[z].size(); j++){
int x=vec1[z][i];
int y=vec1[z][j];
if(a[x][y]==1){
vec[x].push_back(y);
vec[y].push_back(x);
}
}
v1.clear();
for(int i=0; i<vec1[z].size(); i++){
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... |