Submission #1077845

#	Time	Username	Problem	Language	Result	Execution time	Memory
1077845		Boas	Split the Attractions (IOI19_split)	C++17	0 / 100	564 ms	1048576 KiB

split

#include "split.h"

#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define pb push_back
#define loop(x, i) for (int i = 0; i < x; i++)
#define rev(x, i) for (int i = (int)x - 1; i >= 0; i--)
#define ALL(x) begin(x), end(x)
typedef signed i32;
typedef vector<i32> vi32;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vb> vvb;

vi find_split(int n, int A, int B, int C, vi p, vi q)
{
	map<int, int> partix;
	partix[A] = 1;
	partix[B] = 2;
	partix[C] = 3;
	array<int, 3> tmp = {A, B, C};
	sort(ALL(tmp));
	auto [a, b, c] = tmp;
	vvi adj(n);
	int m = sz(p);
	loop(m, i)
	{
		adj[p[i]].pb(q[i]);
		adj[q[i]].pb(p[i]);
	}
	vi res(n);
	auto dfs = [&](auto &&self, int i, int prev, int cnt) -> void
	{
		if (cnt < a)
			res[i] = partix[a];
		else if (cnt < a + b)
			res[i] = partix[b];
		else
			res[i] = partix[c];
		for (int j : adj[i])
		{
			if (j == prev)
				continue;
			self(self, j, i, cnt + 1);
		}
	};
	loop(n, i)
	{
		if (adj[i].size() == 1)
		{
			dfs(dfs, i, i, 0);
			break;
		}
	}
	// assert(*min_element(ALL(res)) == 1);
	assert(*max_element(ALL(res)) != 0);
	return res;
}

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