Submission #823063

#TimeUsernameProblemLanguageResultExecution timeMemory
823063Sohsoh84Connecting Supertrees (IOI20_supertrees)C++17
0 / 100
0 ms212 KiB
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer;
	for (int i = 0; i < n; i++) {
		vector<int> row;
		row.resize(n, 0);
		answer.push_back(row);
	}

	for (int i = 1; i < n; i++) {
		int lst = i;
		for (int j = 0; j < i; j++) {
			if (p[i][j]) {
				if (!lst) lst = i;
				else if (!p[lst][j]) return 0;
			}
		}

		if (lst < i) answer[i][lst] = answer[lst][i] = 1;
	}

	build(answer);
	return 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...