# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
720124 | mseebacher | Connecting Supertrees (IOI20_supertrees) | C++17 | 0 ms | 212 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 construct(std::vector<std::vector<int>> p) {
int n = p.size();
vector<vector<int>> comp(n);
for(int i = 0;i<n;i++){
for(int j = 0;j<n;j++){
if(p[i][j]){
comp[i].push_back(j);
}
}
}
for(int i = 0;i<n;i++){
for(int j = 0;j<n;j++){
if(p[i][j] && comp[i] != comp[j]) return 0;
}
}
vector<bool> vis(n,0);
vector<vector<int>> ans(n,vector<int>(n,0));
for(int i = 0;i<n;i++){
if(!vis[i]){
for(int j = 0;j<(int)comp[i].size();j++){
vis[comp[i][j]] = 1;
if(j == comp[i].size()-1) {
ans[comp[i][j]][comp[i][0]] = 1;
ans[comp[i][0]][comp[i][j]] = 1;
}else{
ans[comp[i][j]][comp[i][j+1]] = 1;
ans[comp[i][j+1]][comp[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... |