Submission #421180

#	Time	Username	Problem	Language	Result	Execution time	Memory
421180		Apiram	슈퍼트리 잇기 (IOI20_supertrees)	C++14	0 / 100	1 ms	292 KiB

supertrees

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

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