제출 #720111

#제출 시각아이디문제언어결과실행 시간메모리
720111mseebacher슈퍼트리 잇기 (IOI20_supertrees)C++17
11 / 100
190 ms24000 KiB
#include "supertrees.h"
#include <bits/stdc++.h> 

using namespace std;

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	vector<vector<int>> ans(n,vector<int>(n,0));
	for(int i = 0;i<n-1;i++){
		ans[i][i+1] = 1;
		ans[i+1][i] = 1;
	}
	build(ans);
	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...