Submission #1218534

#TimeUsernameProblemLanguageResultExecution timeMemory
1218534tamzidConnecting Supertrees (IOI20_supertrees)C++20
0 / 100
0 ms328 KiB
#include "supertrees.h"
#include <vector>
using namespace std;

int construct(std::vector<std::vector<int>> p) {
	
	int n = p.size();

	if(n == 1)
	{
		build({{0}});
		return 1;
	}

    vector<vector<int>> a(n,vector<int>(n,0));

    for(int i=0;i<n;++i)
    {
        for(int j=i+1;j<n;++j)
        {
            if(p[i][j] != p[j][i])
            {
                build({{0}});
                return 1;
            }
            else
            {
                if(p[i][j] == 1)
                {
                    a[i][j] = 1;
                    a[j][i] = 1;
                }
            }
        }
    }

	build(a);

	return 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...