Submission #328947

#TimeUsernameProblemLanguageResultExecution timeMemory
328947dolijanConnecting Supertrees (IOI20_supertrees)C++14
11 / 100
258 ms24044 KiB
#include "supertrees.h"
#include <vector>
using namespace std;
int construct(std::vector<std::vector<int> > p) {
	int n = p.size();
	std::vector<std::vector<int> > answer;
	answer.resize(n);
	for(int i=0;i<n;i++) answer[i].resize(n);
	for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            if(i==j+1) answer[i][j]=1;
            else if(i==j-1) answer[i][j]=1;
            else answer[i][j]=0;
        }
    }
	build(answer);
	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...