# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
424575 | berrygarlic | Connecting Supertrees (IOI20_supertrees) | C++14 | 270 ms | 27080 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"
using namespace std;
int construct(vector<vector<int> > p){
int n = p.size();
vector<vector<int> > b(n,vector<int>(n)),t(n,vector<int>(n));
bool vis[n];
memset(vis,false,sizeof(vis));
for(int i=0;i<n;i++){
if(vis[i]) continue;
vector<int> line;
for(int j=0;j<n;j++){
if(p[i][j] == 1){
line.push_back(j);
}
}
for(int j=0;j<line.size();j++){
if(vis[line[j]]){
return 0;
}
vis[line[j]] = true;
for(int k=0;k<line.size();k++){
if(p[line[j]][line[k]] != 1){
return 0;
}
t[line[j]][line[k]] = true;
}
}
for(int j=1;j<line.size();j++){
b[line[j]][line[j-1]] = b[line[j-1]][line[j]] = true;
}
}
if(p != t) return 0;
build(b);
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... |