Submission #1047695

#	Time	Username	Problem	Language	Result	Execution time	Memory
1047695		Kel_Mahmut	Split the Attractions (IOI19_split)	C++14	18 / 100	48 ms	15188 KiB

split

#include "split.h"
#include <bits/stdc++.h>
#define pb push_back
// #define endl ("\n")
#define all(aa) aa.begin(), aa.end()
typedef long long ll;
using namespace std;


vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	int m = q.size();

	vector<vector<int>> g(n);
	for(int i = 0; i < m; i++){
		g[q[i]].pb(p[i]);
		g[p[i]].pb(q[i]);
	}

	bool chain = 1;
	for(int i = 0; i < n; i++) chain &= (int) g[i].size() <= 2;
	if(chain){
		vector<int> vis(n);
		vector<int> color(n);
		int lim = 0;
		int cnt = 0;
		int komsu;
		function<void(int, int)> dfs = [&](int u, int col){
			cnt++;
			color[u] = col;
			vis[u] = 1;
			if(cnt == lim){
				for(int v : g[u]){
					if(!vis[v]){
						komsu = v;
						return;
					}
				}
				komsu = -1;
				return;
			}
			for(int v : g[u]){
				if(vis[v]) continue;
				dfs(v, col);
				if(cnt == lim) return;
			}
		};
		vector<int> deg1;
		for(int i = 0; i < n; i++) if(g[i].size() == 1) deg1.pb(i);
		lim = a;
		cnt = 0;

		if(deg1.size())
			dfs(deg1[0], 1);
		else{
			for(int i = 0; i < n; i++){
				if(!vis[i]){
					dfs(i, 1);
					break;
				}	
			}
		}

		lim = b; cnt = 0;
		if(deg1.size())
			dfs(deg1[1], 2);
		else{
			assert(komsu != -1);
			dfs(komsu, 2);
		}
		
		lim = c; cnt = 0;
		for(int i = 0; i < n; i++){
			if(!vis[i]){
				dfs(i, 3);
				break;
			}
		}

		return color;	
	}	

	if(a == 1){
		vector<int> vis(n);
		vector<int> color(n);
		int lim = b;
		int cnt = 0;
		function<void(int, int)> dfs = [&](int u, int col){
			cnt++;
			vis[u] = 1;
			color[u] = col;
			if(cnt == lim) return;
			for(int v : g[u]){
				if(vis[v]) continue;
				dfs(v, col);
				if(cnt == lim) return;
			}
		};
		dfs(0, 2);
		for(int i = 0; i < n; i++){
			if(!vis[i]){
				vis[i] = 1;
				color[i] = 1;
				break;
			}
		}

		for(int i = 0; i < n; i++){
			if(!vis[i]){
				vis[i] = 1;
				color[i] = 3;
			}
		}
		return color;
	}

	if(m == n - 1){
		vector<pair<int, int>> sorted; 
		sorted.pb({a, 1}); sorted.pb({b, 2}); sorted.pb({c, 3});
		sort(all(sorted));

		vector<int> sub(n);
		vector<int> color(n);

		int lim = sorted[1].first;
		int cnt = 0;
		bool ok = 0;
		function<void(int, int, int)> fill = [&](int u, int par, int col){
			color[u] = col;
			cnt++;
			if(cnt == lim) return;
			for(int v : g[u]){
				if(color[v] || v == par) continue;
				fill(v, u, col);
				if(cnt == lim) return;
			}
		};

		function<int(int, int)> dfs = [&](int u, int par){
			sub[u] = 1;
			for(int v : g[u]){
				if(v == par) continue;
				sub[u] += dfs(v, u);
			}
			int mxsub = 0;
			for(int v : g[u]){
				if(v == par) continue;
				mxsub = max(mxsub, sub[v]);
			}
			if(!ok && sub[u] >= sorted[1].first && mxsub < sorted[1].first){
				ok = 1;
				fill(u, par, sorted[1].second);
			}
			return sub[u];
		};
		dfs(0, -1);
		if(!ok || cnt < lim){
			for(int i = 0; i < n; i++) color[i] = 0;
			return color;
		}

		sub.assign(n, 1);
		vector<int> vis(n);
		function<int(int, int)> dfs1 = [&](int u, int par){
			vis[u] = 1;
			for(int v : g[u]){
				if(color[v] || par == v) continue;
				sub[u] += dfs1(v, u);
			}
			return sub[u];
		};
		cnt = 0;
		lim = sorted[0].first;
		for(int i = 0; i < n; i++){
			if(color[i] || vis[i]) continue;
			if(sorted[0].first <= dfs1(i, -1)){
				fill(i, -1, sorted[0].second);
			}
		}

		if(cnt < lim){
			// assert(0);
			for(int i = 0; i < n; i++) color[i] = 0;
			return color;
		}
		for(int i = 0; i < n; i++){
			if(color[i]) continue;
			color[i] = sorted[2].second;
		}
		return color;
	}
}

Compilation message (stderr)

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:13:25: warning: control reaches end of non-void function [-Wreturn-type]
   13 |  vector<vector<int>> g(n);
      |                         ^

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