Submission #300342

#	Time	Username	Problem	Language	Result	Execution time	Memory
300342		nadidadit	Connecting Supertrees (IOI20_supertrees)	C++17	0 / 100	1 ms	256 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
 
#define all(c) ((c).begin()), ((c).end())
int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> adj(n, vector<int>(n, 0));
	function<void(int, int)> add_edge = [&](int x, int y){
		adj[x][y] = adj[y][x] = 1;
	};
	for(int i = 0; i < n; i++){
		if(p[i][i] != 1) return 0;
		for(int j = i + 1; j < n; j++){
			if(p[i][j] != p[j][i]) return 0;
		}
	}
	for(int i=0;i<n-1;i++)
    {
    	p[i][i+1]=1;
    	p[i+1][i]=1;
	}
	build(adj);
	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