Submission #429259

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

supertrees

#include "supertrees.h"
#include "bits/stdc++.h"
using namespace std;

int construct(vector<vector<int> > p){
	int n=p.size();

	int res[n][n];
	memset(res,0,sizeof res);
	for(int i=1;i<5;i++)
		res[i-1][i]=res[i][i-1]=1;

	vector<vector<int> > ans;
	for(int i=0;i<n;i++){
		vector<int> row(n);
		for(int j=0;j<n;j++) row[j]=res[i][j];
		ans.push_back(row);
	}
	build(ans);
	
	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