제출 #696396

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
696396		T0p_	슈퍼트리 잇기 (IOI20_supertrees)	C++14	19 / 100	276 ms	27992 KiB

supertrees

// Subtask 3
 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
 
const int N = 1000;
 
bool visited[N];
 
int construct(vector<vector<int>> p)
{
	int n = p.size();
	vector<vector<int>> ans(n, vector<int> (n, 0));
	
	vector<int> connectedList[n];
	for (int i=0 ; i<n ; i++) for (int j=0 ; j<n ; j++) if (i == j || p[i][j] == 2) connectedList[i].push_back(j);
  
  	for (int i=0 ; i<n ; i++) if (connectedList[i].size() == 2) return 0;
	
	for (int i=0 ; i<n ; i++) for (int j=0 ; j<n ; j++) if (p[i][j] == 2 && connectedList[i] != connectedList[j]) return 0;

	for (int i=0 ; i<n ; i++) if (!visited[i] && connectedList[i].size() > 1)
	{
		int prv = connectedList[i].back();
		for (int cur : connectedList[i])
		{
			visited[cur] = true;
			ans[prv][cur] = ans[cur][prv] = 1;
			prv = cur;
		}
	}
 
	build(ans);
	return 1;
}

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