Submission #893564

#	Time	Username	Problem	Language	Result	Execution time	Memory
893564		Faisal_Saqib	Split the Attractions (IOI19_split)	C++17	0 / 100	2 ms	6236 KiB

split

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int N=1e5+2;
vector<int> ma[N],ch[N],ans;
bool vis[N];
int sz[N],up[N],h[N],n;
pair<int,int> comp[3];
bool f=0;
void dfs_color1(int x,int co)
{
	if(vis[x])
		return;
	if(comp[co].first==0)
		return;
	vis[x]=1;
	ans[x]=comp[co].second;
	comp[co].first--;
	for(int i:ma[x])
		if(!vis[i])
			dfs_color1(i,co);
}
void dfs_color(int x,int co)
{
	if(vis[x])
		return;
	if(comp[co].first==0)
		return;
	vis[x]=1;
	ans[x]=comp[co].second;
	comp[co].first--;
	for(int i:ch[x])
		if(!vis[i])
			dfs_color(i,co);
}
void dfs_ch(int x)
{
	sz[x]=1;
	vis[x]=1;
	up[x]=h[x];
	for(int y:ma[x])
	{
		if(!vis[y])
		{
			h[y]=h[x]+1;
			dfs_ch(y);
			sz[x]+=sz[y];
			ch[x].push_back(y);
			up[x]=min(up[x],up[y]);
		}
		else
		{
			up[x]=min(up[x],h[y]);
		}
	}
}
void dfs(int x,int q=-1)
{
	if(f)
		return;
	int P1=sz[x];
	int P2=sz[0]-P1;
	for(int y:ch[x])
	{
		dfs(y);
		if(f)
			return;
	}
	vector<int> left;
	for(int y:ch[x])
	{
		if(up[y]<h[x] and (P1-sz[y])>=comp[0].first)
		{
			P1-=sz[y];
			P2+=sz[y];
		}
		else
			left.push_back(y);
		if(P1>=comp[0].first and P2>=comp[1].first)
		{
			for(int i=0;i<n;i++)
				vis[i]=0;
			vis[x]=1;
			ans[x]=comp[0].second;
			comp[0].first--;
			for(int y:left)
				dfs_color(y,0);
			dfs_color1(1,1);
			f=1;
			return;
		}
		if(P2>=comp[0].first and P1>=comp[1].first)
		{
			for(int i=0;i<n;i++)
				vis[i]=0;
			vis[x]=1;
			ans[x]=comp[1].second;
			comp[1].first--;
			for(int y:left)
				dfs_color(y,1);
			dfs_color1(1,0);
			f=1;
			return;
		}
	}
}
vector<int> find_split(int n1, int a, int b, int c, vector<int> p, vector<int> q)
{
	n=n1;
	comp[0]={a,1},comp[1]={b,2},comp[2]={c,3};
	sort(comp,comp+3);
	int m=p.size();
	for(int i=0;i<m;i++)
		ma[p[i]].push_back(q[i]),ma[q[i]].push_back(p[i]);
	ans.resize(n,comp[2].second);
	for(int j=0;j<1;j++)
	{
		dfs_ch(j);
		for(int i=0;i<n;i++)
		{
			ans[i]=comp[2].second;;
			vis[i]=0;
		}
		dfs(j);
		if(f)
			return ans;	
	}
	if(!f)
		for(int i=0;i<n;i++)
			ans[i]=0;
	return ans;
}

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