Submission #1291678

#	Time	Username	Problem	Language	Result	Execution time	Memory
1291678		gustavo_d	Connecting Supertrees (IOI20_supertrees)	C++20	0 / 100	2 ms	348 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

#define sz(v) (int)(v).size()

const int MAXN = 1000;

vector<int> adj[MAXN];
vector<pair<int, int>> eds;
bool mark[MAXN], cycle[MAXN];

int construct(vector<vector<int>> paths) {
	int n = sz(paths);

	for (int i=0; i<n; i++) {
		for (int j=0; j<n; j++) {
			if (i == j) continue;
			if (paths[i][j] == 0) continue;
			adj[i].push_back(j);
		}
	}

	for (int i=0; i<n; i++) {
		if (mark[i]) continue;

		vector<int> in{i};
		cycle[i] = true;
		for (int j=0; j<n; j++) {
			if (i == j) continue;
			if (paths[i][j] == 2) {
				cycle[j] = true;
				in.push_back(j);
			}
		}
		if (sz(in) == 1) continue;
		for (int v : in) {
			for (int j=v+1; j<n; j++) {
				if (cycle[v] and paths[j][v] != 2) return 0;
				if (!cycle[v] and paths[j][v] == 2) return 0;
			}
		}

		for (int v : in) cycle[v] = false;

		for (int j=0; j<sz(in); j++) eds.emplace_back(in[j], in[j-1]);
		eds.emplace_back(in[0], in.back());
	}

	vector<vector<int>> ans(n, vector<int> (n, 0));
	// cerr << sz(eds) << '\n';
	for (auto [u, v] : eds) {
		// cerr << u << ' ' << v << '\n';
		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