Submission #977662

#	Time	Username	Problem	Language	Result	Execution time	Memory
977662		SmuggingSpun	슈퍼트리 잇기 (IOI20_supertrees)	C++14	11 / 100	155 ms	20100 KiB

supertrees

#include "supertrees.h"
#include<bits/stdc++.h>
using namespace std;
int construct(vector<vector<int>>p){
	int n = p.size();
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(p[i][j] != 1){
				return 0;
			}
		}
		fill(p[i].begin(), p[i].end(), 0);
	}
	for(int i = 1; i < n; i++){
		p[i][i - 1] = p[i - 1][i] = 1;
	}
	build(p);
	return 1;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 10
• Subtask 3: 0 / 19
• Subtask 4: 0 / 35
• Subtask 5: 0 / 21
• Subtask 6: 0 / 4