제출 #1087031

#제출 시각아이디문제언어결과실행 시간메모리
1087031SulA슈퍼트리 잇기 (IOI20_supertrees)C++17
11 / 100
131 ms23980 KiB
#include "supertrees.h"
#include <iostream>
#include <vector>

using namespace std;

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