제출 #1032791

#제출 시각아이디문제언어결과실행 시간메모리
1032791fv3슈퍼트리 잇기 (IOI20_supertrees)C++14
11 / 100
115 ms23936 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;
	for (int i = 0; i < n; i++) 
	{
		vector<int> row(n);
		if (i)
			row[i-1] = 1;

		if (i + 1 < n)
			row[i+1] = 1;

		answer.push_back(row);
	}
	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...