| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 384904 | Ahmadsm2005 | Connecting Supertrees (IOI20_supertrees) | C++14 | 0 ms | 0 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 "grader.cpp"
//#include "supertrees.h"
using namespace std;
int N,edges[1001][1001],GRP[1001],Z;
vector<vector<int>>ALL;
void CONNECT(vector<int>X){
for(int i=1;i<X.size();i++)
edges[X[i]][X[i-1]]=1,edges[X[i-1]][X[i]]=1;
}
int construct(std::vector<std::vector<int>>p){
N=p.size();
for(int i=0;i<1001;i++)
GRP[i]=-1;
for(int i=0;i<N;i++){
if(!p[i][i])
exit(-1);
vector<int>TEMP;
if(GRP[i]+1)
continue;
TEMP.push_back(i);
GRP[i]=Z;
for(int l=0;l<N;l++){
if(p[i][l]&&i!=l){
if(GRP[l]+1)
return 0;
TEMP.push_back(l),GRP[l]=Z;
}
}
for(int l=0;l<TEMP.size();l++){
int CNT=0;
for(int x=0;x<TEMP.size();x++){
if(l!=x&&(!p[TEMP[l]][TEMP[x]]))
return 0;
}
for(int x=0;x<N;x++)
if(p[TEMP[l]][x])
CNT++;
if(CNT!=TEMP.size())
return 0;
}
ALL.push_back(TEMP);
Z++;
}
for(int i=0;i<ALL.size();i++)
CONNECT(ALL[i]);
vector<vector<int>>ANS;
for(int i=0;i<N;i++){
vector<int>FF;
for(int l=0;l<N;l++)
FF.push_back(edges[i][l]);
ANS.push_back(FF);
}
build(ANS);
return 1;
}
