Submission #433530

#	Time	Username	Problem	Language	Result	Execution time	Memory
433530		JUANDI321	Split the Attractions (IOI19_split)	C++17	0 / 100	634 ms	1048580 KiB

split

#include "split.h"
#include <vector>

using namespace std;
vector<vector<int>> g(100100);
vector<int> rest(100100);
int aa, bb, cc;

void dfs(int node, int ant)
{
	if(aa>0)
	{
		rest[node]=1;
		aa--;
	}
	else if(bb>0)
	{
		rest[node]=2;
		bb--;
	}
	else 
	{
		rest[node]=3;
		cc--;
	}
	for(int y : g[node])
	{
		if(y!=ant)
		{
			dfs(y, node);
		}
	}
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) 
{
	aa = a;
	bb = b;
	cc = c;
	vector<int> res;
	int m = p.size();
	for(int i = 0; i<m; i++)
	{
		g[p[i]].push_back(q[i]);
		g[q[i]].push_back(p[i]);
	}
	int node =0;
	for(int i = 0; i<n; i++)
	{
		if(g[i].size()==1)
		{
			node = i;
			break;
		}
	}
	dfs(node, -1);
	for(int i = 0; i<n; i++)res[i] = rest[i];
	return res;
}

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