Submission #696386

#	Time	Username	Problem	Language	Result	Execution time	Memory
696386		T0p_	Connecting Supertrees (IOI20_supertrees)	C++14	0 / 100	158 ms	22036 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() > 1 && connectedList[i].size() < 3) 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])
	{
		visited[i] = true;

		int u = -1, v = -1;
      	for (int j=i+1 ; j<n ; j++) if (p[i][j] == 2)
		{
			ans[i][j] = ans[j][i] = 1;
			if (u == -1) u = j;
			else if (v == -1) v = j;
		}
		if (u != -1 && v != -1) ans[u][v] = ans[v][u] = 1;
	}
 
	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