# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
403552 | victoriad | Connecting Supertrees (IOI20_supertrees) | C++14 | 252 ms | 26016 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 <vector>
#include <cmath>
#include <cstdio>
using namespace std;
int construct(std::vector<std::vector<int> > p) {
int n = p.size();
vector<vector<int> >r(n);
vector<vector<int> >c;
vector<int>us(n,-1);
int cc=0;
for(int i=0;i<n;i++){
if(us[i]==-1){
vector<int>s=p[i];
c.push_back(s);
for(int k=0;k<n;k++){
if(s[k]!=0){
if(us[k]==-1){
us[k]=cc;
}
}
}
cc++;
}
else{
int x=us[cc];
for(int k=0;k<n;k++){
if(c[x][k]==p[i][k])continue;
else{
if(c[x][k]==0){
//return 0;
// break;
}
if(c[x][k]!=0 && p[i][k]==0){
return 0;
break;
}
}
}
}
}
vector<int>a(n,0);
for(int i=0;i<n;i++)r[i]=a;;
for(int i=0;i<c.size();i++){
int x=-1;
int l=-1;
int con=0;
for(int k=0;k<c[i].size();k++){
if(c[i][k]==1){
if(l==-1)l=k;
x=k;
con++;
}
if(c[i][k]==2){
con++;
if(x==-1){
x=k;
}
else{
r[k][x]=1;
r[x][k]=1;
x=k;
}
}
}
if(con==2){
return 0;
break;
}
else if(l==x){
}
else{
r[l][x]=1;
r[x][l]=1;
}
}
build(r);
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... |