Submission #411038

#TimeUsernameProblemLanguageResultExecution timeMemory
411038eagle30슈퍼트리 잇기 (IOI20_supertrees)C++17
11 / 100
230 ms23960 KiB
#include "supertrees.h"
#include<bits/stdc++.h>
using namespace std;
int construct(vector<vector<int> > p) {
	int n = p.size();
	vector<vector<int> > answer;
	answer.assign(n, vector<int>());
	for(int i=0; i<n; i++)
		answer[i].assign(n, 0);
	for (int i = 0; i < n-1; i++) {
		answer[i][i+1]=1;
		answer[i+1][i]=1;
	}
	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...