Submission #1237185

#	Time	Username	Problem	Language	Result	Execution time	Memory
1237185		MuhammadSaram	Split the Attractions (IOI19_split)	C++20	18 / 100	53 ms	15176 KiB

split

#include "split.h"
#include <bits/stdc++.h>

using namespace std;

const int M = 1e5;

vector<int> nei[M], cc;
int subt[M], dep[M];
bool vis[M];

void init(int u)
{
	subt[u]=1, vis[u]=1;
	for (int i:nei[u])
		if (!vis[i])
			dep[i]=dep[u]+1, init(i), subt[u]+=subt[i];
}

void dfs(int u, int a)
{
	cc.push_back(u);
	vis[u]=1;
	for (int i:nei[u])
	{
		if (cc.size()==a) break;
	 	if(!vis[i])
			dfs(i,a);
	}	
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q)
{
	int m=p.size();
	for (int i=0;i<m;i++)
		nei[p[i]].push_back(q[i]), nei[q[i]].push_back(p[i]);
	init(0);
	for (int i=0;i<n;i++) vis[i]=0;
	vector<int> ans(n);
	vector<pair<int,int>> ord={{a,1},{b,2},{c,3}};
	sort(ord.begin(),ord.end());
	for (int i=0;i<n;i++)
		if (subt[i]>=ord[0].first && n-subt[i]>=ord[1].first)
		{
			for (int u:nei[i])
				if (dep[u]<dep[i]) vis[u]=1;
			cc.clear();
			dfs(i,ord[0].first);
			for (int u:nei[i]) vis[u]=0;
			vis[i]=1;
			for (int x:cc) ans[x]=ord[0].second;
			cc.clear();
			dfs(0,ord[1].first);
			for (int x:cc) ans[x]=ord[1].second;
			for (int j=0;j<n;j++)
				if (!ans[j])
					 ans[j]=ord[2].second;
			return ans;
		}
	return ans;
}

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