Submission #1207775

#TimeUsernameProblemLanguageResultExecution timeMemory
1207775tamzid슈퍼트리 잇기 (IOI20_supertrees)C++20
0 / 100
1 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)
	{
		a[i-1][i] = 1;
		a[i][i-1] = 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...