# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1103956 | SteveBro | Connecting Supertrees (IOI20_supertrees) | C++17 | 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 <iostream>
using namespace std;
int n,mat[101][101];
void build(int b[][101])
{
}
int construct(int p[][101])
{
int i,j;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(p[i][j]==3||p[i][j]!=p[j][i])
return 0;
}
}
for(i=1;i<=n;i++)
if(p[i][i]!=0)
return 0;
int mat[101][101];
build(mat);
return 1;
}
int main()
{
cin>>n;
/// cout<<construct([[1, 1, 2, 2], [1, 1, 2, 2], [2, 2, 1, 2], [2, 2, 2, 1]]);
return 0;
}