# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
756324 | Trumling | 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.
bool dfs1(int start,int beg)
{
vis[start]=1;
for(int i=0;i<nn;i++)
if(g[start][i]!=g[beg][i] && i!=start && i!=beg)
return 0;
for(int i=0;i<nn;i++)
if(!vis[i] && g[start][i]==1)
{
ans[i][start]=1;
ans[start][i]=1;
return dfs1(i,beg);
}
vis[beg]=0;
return 1;
}
bool dfs2(int start,int beg)
{
vis[start]=1;
for(int i=0;i<nn;i++)
if(g[start][i]!=g[beg][i] && i!=start && i!=beg)
return 0;
//ll count=0;
//for(int i=0;i<nn;i++)
//if(g[start][i]==2)
//count++;
//if(count==1)
//return 0;
for(int i=0;i<nn;i++)
if(!vis[i] && g[start][i]==2)
{
ans[i][start]=1;
ans[start][i]=1;
return dfs2(i,beg);
}
ans[start][beg]=1;
ans[beg][start]=1;
return 1;
}
int construct(vector<vector<int>> pr)
{
nn=pr.size();
g=pr;
ans.assign(nn,vector<int>(nn,0));
for(int i=0;i<nn;i++)
{
bool now=dfs1(i,i);
if(!now)
return 0;
}
for(int i=0;i<nn;i++)
{
if(vis[i])
continue;
bool now=dfs2(i,i);
if(!now)
return 0;
}
for(int i=0;i<nn;i++)
ans[i][i]=0;
build(ans);
return 1;
}