Submission #422333

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

supertrees

#include "supertrees.h"
#include<bits/stdc++.h>
using namespace std;
int construct(vector<std::vector<int>> p) {
	int n = p.size();
	vector<vector<int>>answer(n,vector<int>(n,0));
	/* 
	1 1 2 2
	1 1 2 2
	2 2 1 2
	2 2 2 1
	*/
	for (int i =0;i<n;++i){
	p[i][i]=0;
	}
	for (int i =0;i<n;++i){
		for (int j =0;j<i;++j){
		if (p[i][j]>=3)return 0;
		}
	}
	vector<vector<int>>adj(n);
	for (int i =1;i<n;++i){
		for (int j =0;j<i;++j){
		 if (p[i][j]>0){
		     if (adj[i].empty()){
		     answer[i][j]++;
		     answer[j][i]++;
		     adj[i].push_back(j);
		     adj[j].push_back(i);
		     }
		 
		 }
		 }
	}
	for (int i =1;i<n;++i){
		for (int j =0;j<i;++j){
		if (p[i][j]>0)return 0;
		}
	}	
																							
	
	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