제출 #1083731

#제출 시각아이디문제언어결과실행 시간메모리
1083731rayan_bd슈퍼트리 잇기 (IOI20_supertrees)C++17
11 / 100
120 ms23980 KiB
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;


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