제출 #1343512

#제출 시각아이디문제언어결과실행 시간메모리
1343512adriines06슈퍼트리 잇기 (IOI20_supertrees)C++20
11 / 100
88 ms22024 KiB
#include "supertrees.h"
#include <vector>
#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));
	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...