제출 #810370

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
810370		Sohsoh84	Split the Attractions (IOI19_split)	C++17	40 / 100	85 ms	25428 KiB

split

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

using namespace std;

typedef pair<int, int> pll;

#define sep		' '
#define debug(x)	cerr << #x << ": " << x << endl;
#define X		first
#define Y		second

const int MAXN = 2e5 + 10;

vector<int> adj[MAXN], path;
int a, b, c, n, m, ans[MAXN], sz[MAXN], T[4] = {0, 1, 2, 3};
bool flag = false;
pll cyc_edge = {0, 0};

inline bool check(int u, int v) {
	return pll(u, v) == cyc_edge || pll(v, u) == cyc_edge;
}

void dfs_ans(int v, int p, int c, int& cnt) {
	if (cnt) {
		ans[v] = c;
		cnt--;
	}

	for (int u : adj[v]) {
		if (u == p || check(u, v)) continue;
		dfs_ans(u, v, c, cnt);
	}
}

void dfs_path(int v, int p, int tar) {
	path.push_back(v);
	for (int u : adj[v]) {
		if (u == p || check(u, v)) continue;
		if (path.back() != tar) dfs_path(u, v, tar);
	}

	if (path.back() != tar)
		path.pop_back();
}

void dfs1(int v, int p) {
	sz[v] = 1;
	for (int u : adj[v]) {
		if (u == p || check(u, v)) continue;

		dfs1(u, v);
		sz[v] += sz[u];

		if (!flag && sz[u] >= a && n - sz[u] >= b) {
			flag = true;
			dfs_ans(u, v, 1, a);
			dfs_ans(v, u, 2, b);
		}

		if (!flag && sz[u] >= b && n - sz[u] >= a) {
			flag = true;
			dfs_ans(u, v, 2, b);
			dfs_ans(v, u, 1, a);
		}
	}
}

namespace DSU {
	int par[MAXN];

	inline void init() {
		for (int i = 1; i <= n; i++)
			par[i] = i;
	}

	int find(int v) {
		return par[v] == v ? v : par[v] = find(par[v]);
	}

	inline bool unite(int u, int v) {
		u = find(u), v = find(v);
		if (u == v) return false;
		par[v] = u;
		
		return true;
	}
}

vector<int> find_split(int n_, int a_, int b_, int c_, vector<int> p_, vector<int> q_) {
	n = n_, a = a_, b = b_, c = c_;
	if (b > c) swap(b, c), swap(T[2], T[3]);
	if (a > c) swap(a, c), swap(T[1], T[3]);
	if (a > b) swap(a, b), swap(T[1], T[2]);
	
	m = p_.size();	

	DSU::init();

	for (int i = 0; i < m; i++) {
		int u = p_[i], v = q_[i];
		u++, v++;
		if (DSU::unite(u, v)) adj[u].push_back(v), adj[v].push_back(u);
		else cyc_edge = {u, v};
	}	

	dfs1(1, 0);
	if (cyc_edge.X) {
		dfs_path(cyc_edge.X, 0, cyc_edge.Y);

		adj[cyc_edge.X].push_back(cyc_edge.Y);
		adj[cyc_edge.Y].push_back(cyc_edge.X);
		for (int i = 0; i < int(path.size()) - 1; i++) {
			if (flag) break;

			cyc_edge = {path[i], path[i + 1]};
			dfs1(1, 0);		
		}
	}

	if (*max_element(ans + 1, ans + n + 1) > 0) {
		for (int i = 1; i <= n; i++)
			if (ans[i] == 0)
				ans[i] = 3;
	}

	vector<int> res;
	for (int i = 1; i <= n; i++)
		res.push_back(T[ans[i]]);
	return res;
}

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