Submission #1242604

#	Time	Username	Problem	Language	Result	Execution time	Memory
1242604		haithamcoder	Split the Attractions (IOI19_split)	C++20	0 / 100	0 ms	320 KiB

split

#include<bits/stdc++.h>
using namespace std;
#define ll int



vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	// vector<ll> res;
	vector<vector<ll>> adj(n);

	ll m = p.size();

	for (ll i = 0; i < m; i++) {
		adj[p[i]].push_back(q[i]);
		adj[q[i]].push_back(p[i]);
	}

	ll root = 0;

	for (ll i = 0; i < n; i++) {
		if (adj[i].size() == 1) {
			root = i;
			break;
		}
	}


	ll par = -1, u = root;

	vector<ll> res;
	ll num = 1;
	ll cnt = 0;

	while (num < 4) {
		res[u] = num;
		cnt++;

		for (auto c : adj[u]) {
			if (c != par) {
				par = u;
				u = c;
			}
		}

		if ((num == 1 && cnt > a) || (num == 2 && cnt > b) || (num == 3 && cnt > c)) {
			num++;
			cnt = 0;
		}

		if (num == 4) return res;
	}

	return res;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 22
• Subtask 4: 0 / 24
• Subtask 5: 0 / 36