Submission #1024201

#	Time	Username	Problem	Language	Result	Execution time	Memory
1024201		vjudge1	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	118 ms	22100 KiB

supertrees

#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>

using namespace std;

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	std::vector<std::vector<int>> answer(n, vector<int>(n, 0));
	vector<bool> visited(n, false);
	for (int i = 0; i < n; i++) {
		if(p[i][i] == 0) return 0;
		if(visited[i]) continue;
		for(int j = 0; j < n; ++j){
			if(i == j) continue;

			if(p[i][j] == 1) {
				visited[j] = true;
				answer[i][j] = 1;
				answer[j][i] = 1;
			}

		}
	}
	build(answer);
	return 1;
}

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