# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
393129 | Carmel_Ab1 | 슈퍼트리 잇기 (IOI20_supertrees) | C++17 | 1 ms | 204 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"
//#include "grader.cpp"
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
vvi who;
vector<bool>vis;
vvi P;
void dfs(int src){
int n=vis.size();
vis[src]=1;
who.back().push_back(src);
for(int nbr=0; nbr<n; nbr++)
if(P[src][nbr]==2 && !vis[nbr])
dfs(nbr);
}
int construct(vvi p) {
int n = p.size();
vvi ans(n,vi(n));
P=vvi(p);
vis.resize(n);
for(int i=0; i<n; i++){
if(!vis[i]){
who.push_back({});
dfs(i);
}
}
for(int i=0; i<who.size(); i++)
for(int j=0; j<who[i].size(); j++){
ans[who[i][j]][who[i][(j+1)%who[i].size()]]=1;
ans[who[i][(j+1)%who[i].size()]][who[i][j]]=1;
}
build(ans);
return 1;
}
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... |