Submission #768387

#	Time	Username	Problem	Language	Result	Execution time	Memory
768387		marvinthang	Split the Attractions (IOI19_split)	C++17	100 / 100	108 ms	32752 KiB

split

/*************************************
*    author: marvinthang             *
*    created: 28.06.2023 10:35:00    *
*************************************/

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

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

vector <int> find_split(int n, int a, int b, int c, vector <int> P, vector <int> Q) {
	int m = P.size();
	vector <vector <int>> adj(n), tree_adj(n);
	REP(i, m) {
		adj[P[i]].push_back(i);
		adj[Q[i]].push_back(i);
	}

	vector <int> low(n, n + 1), num(n), treeSize(n);
	vector <bool> used(m);
	int timeDfs = 0;
	function <void(int)> dfs = [&] (int u) {
		num[u] = ++timeDfs;
		treeSize[u] = 1;
		for (int id: adj[u]) {
			used[id] = true;
			int v = P[id] ^ Q[id] ^ u;
			if (!num[v]) {
				tree_adj[u].push_back(v);
				dfs(v);
				treeSize[u] += treeSize[v];
				low[u] = min(low[u], low[v]);
			} else low[u] = min(low[u], num[v]);
		}
	};
	dfs(0);
	vector <pair <int, int>> pt;
	pt.emplace_back(a, 1);
	pt.emplace_back(b, 2);
	pt.emplace_back(c, 3);
	sort(ALL(pt));
	vector <int> res(n);
	REP(t, 2) {
		function <bool(int)> dfs2 = [&] (int u) {
			if (treeSize[u] < pt[t].fi) return false;
			bool ok = true;
			for (int v: tree_adj[u]) if (treeSize[v] >= pt[t].fi) {
				if (dfs2(v)) return true;
				ok = false;
			}
			if (ok) {
				int cur = treeSize[u];
				for (int v: tree_adj[u]) if (low[v] < num[u] && cur - treeSize[v] >= pt[t].fi) {
					res[v] = -1;
					cur -= treeSize[v];
				}
				if (n - cur >= pt[t ^ 1].fi) {
					queue <int> q;
					q.push(u);
					--pt[t].fi;
					res[u] = pt[t].se;
					while (!q.empty()) {
						int u = q.front();
						q.pop();
						for (int v: tree_adj[u]) if (!res[v]) {
							if (!pt[t].fi) break;
							--pt[t].fi;
							res[v] = pt[t].se;
							q.push(v);
						}
					}

					while (!q.empty()) q.pop();
					u = 0;
					while (res[u] == pt[t].se) ++u;
					q.push(u);
					--pt[t ^ 1].fi;
					res[u] = pt[t ^ 1].se;
					while (!q.empty()) {
						int u = q.front();
						q.pop();
						for (int id: adj[u]) {
							int v = P[id] ^ Q[id] ^ u;
							if (res[v] > 0) continue;
							if (!pt[t ^ 1].fi) break;
							--pt[t ^ 1].fi;
							res[v] = pt[t ^ 1].se;
							q.push(v);
						}
					}

					REP(i, n) if (res[i] <= 0) res[i] = pt[2].se;
					return true;
				}
				for (int v: tree_adj[u]) res[v] = 0;
			}
			return false;
		};
		if (dfs2(0)) return res;
	}
	return res;
}

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