oj.uz

Submission #970738

# Submission time Handle Problem Language Result Execution time Memory
970738 2024-04-27T07:44:32 Z GrindMachine Split the Attractions (IOI19_split) C++17
40 / 100
 79 ms 22864 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
https://codeforces.com/blog/entry/68940?#comment-532790
https://codeforces.com/blog/entry/68940?#comment-532806

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "split.h"

vector<int> adj1[N], adj2[N];
vector<bool> vis(N);

void dfs1(int u){
	vis[u] = 1;
	trav(v,adj1[u]){
		if(vis[v]) conts;
		adj2[u].pb(v), adj2[v].pb(u);
		dfs1(v);
	}
}

vector<int> subsiz(N);

void dfs2(int u, int p){
	subsiz[u] = 1;
	trav(v,adj2[u]){
		if(v == p) conts;
		dfs2(v,u);
		subsiz[u] += subsiz[v];
	}
}

int dfs3(int u, int p){
	trav(v,adj2[u]){
		if(v == p) conts;
		if(subsiz[v] > subsiz[0]/2){
			return dfs3(v,u);
		}
	}

	return u;
}

vector<int> nodes[N];

void dfs4(int u, int p, int r){
	nodes[r].pb(u);
	trav(v,adj2[u]){
		if(v == p) conts;
		dfs4(v,u,r);
	}
}

vector<int> ans;
int to_col;

void dfs5(int u, int p){
	if(to_col){
		ans[u] = 1;
		to_col--;
	}

	trav(v,adj2[u]){
		if(v == p) conts;
		if(ans[v] != -1) conts;
		dfs5(v,u);
	}
}

vector<int> find_split(int n, int A, int B, int C, vector<int> U, vector<int> V) {
	rep(i,sz(U)){
		int u = U[i], v = V[i];
		adj1[u].pb(v), adj1[v].pb(u);
	}

	// find arbitrary spanning tree
	dfs1(0);

	// find centroid of spanning tree
	dfs2(0,-1);
	int c = dfs3(0,-1);
		
	// root @centroid
	// wlog, A <= B <= C
	// if any of the subtrees have size >= A, done
	// we can find a cc of size A in that subtree and this may waste at most n/2 nodes (cuz rooted @centroid)
	// B <= n/2, so we can find a cc of size B in the rest of the tree
	vector<int> subs;
	trav(v,adj2[c]){
		subs.pb(v);
		dfs4(v,c,v);
	}

	vector<pii> col_ord = {{A,0},{B,1},{C,2}};
	sort(all(col_ord));
	A = col_ord[0].ff, B = col_ord[1].ff, C = col_ord[2].ff;
	ans = vector<int>(n,-1);

	trav(v,subs){
		if(sz(nodes[v]) < A) conts;
		rep(j,A){
			ans[nodes[v][j]] = 0;
		}

		to_col = B;
		dfs5(c,-1);
		rep(i,n) if(ans[i] == -1) ans[i] = 2;

		rep(i,n) ans[i] = col_ord[ans[i]].ss+1;
		return ans;
	}

	fill(all(ans),0);
	return ans;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7772 KB ok, correct split
2 Correct 2 ms 7768 KB ok, correct split
3 Correct 2 ms 7772 KB ok, correct split
4 Correct 3 ms 7772 KB ok, correct split
5 Correct 2 ms 7772 KB ok, correct split
6 Correct 2 ms 7772 KB ok, correct split
7 Correct 57 ms 22608 KB ok, correct split
8 Correct 55 ms 21072 KB ok, correct split
9 Correct 54 ms 21080 KB ok, correct split
10 Correct 72 ms 22608 KB ok, correct split
11 Correct 60 ms 22860 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7772 KB ok, correct split
2 Correct 2 ms 7772 KB ok, correct split
3 Correct 2 ms 7772 KB ok, correct split
4 Correct 74 ms 21980 KB ok, correct split
5 Correct 59 ms 18268 KB ok, correct split
6 Correct 61 ms 22864 KB ok, correct split
7 Correct 62 ms 21068 KB ok, correct split
8 Correct 79 ms 21076 KB ok, correct split
9 Correct 53 ms 18060 KB ok, correct split
10 Correct 50 ms 21448 KB ok, correct split
11 Correct 50 ms 21452 KB ok, correct split
12 Correct 54 ms 21792 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7772 KB ok, correct split
2 Correct 58 ms 18272 KB ok, correct split
3 Correct 22 ms 11868 KB ok, correct split
4 Correct 2 ms 7772 KB ok, correct split
5 Correct 55 ms 19972 KB ok, correct split
6 Correct 56 ms 20052 KB ok, correct split
7 Correct 56 ms 19948 KB ok, correct split
8 Correct 55 ms 20260 KB ok, correct split
9 Correct 55 ms 20060 KB ok, correct split
10 Correct 18 ms 11356 KB ok, no valid answer
11 Correct 26 ms 13136 KB ok, no valid answer
12 Correct 51 ms 20432 KB ok, no valid answer
13 Correct 56 ms 18516 KB ok, no valid answer
14 Correct 52 ms 21964 KB ok, no valid answer

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7768 KB ok, correct split
2 Correct 2 ms 7772 KB ok, no valid answer
3 Correct 2 ms 7772 KB ok, correct split
4 Correct 2 ms 7852 KB ok, correct split
5 Correct 2 ms 7768 KB ok, correct split
6 Correct 2 ms 7772 KB ok, correct split
7 Correct 2 ms 7772 KB ok, correct split
8 Correct 2 ms 7772 KB ok, correct split
9 Correct 4 ms 8028 KB ok, correct split
10 Correct 4 ms 7976 KB ok, correct split
11 Correct 2 ms 7772 KB ok, correct split
12 Correct 4 ms 8028 KB ok, correct split
13 Correct 2 ms 7772 KB ok, correct split
14 Correct 2 ms 7772 KB ok, correct split
15 Correct 2 ms 7772 KB ok, correct split
16 Correct 2 ms 7768 KB ok, correct split
17 Correct 2 ms 8024 KB ok, correct split
18 Correct 2 ms 7772 KB ok, correct split
19 Correct 2 ms 7772 KB ok, correct split
20 Correct 3 ms 7772 KB ok, correct split
21 Correct 3 ms 8028 KB ok, correct split
22 Correct 3 ms 8192 KB ok, correct split
23 Correct 3 ms 8028 KB ok, correct split
24 Correct 3 ms 8028 KB ok, correct split
25 Correct 4 ms 8172 KB ok, correct split
26 Incorrect 3 ms 8284 KB jury found a solution, contestant did not
27 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7772 KB ok, correct split
2 Correct 2 ms 7768 KB ok, correct split
3 Correct 2 ms 7772 KB ok, correct split
4 Correct 3 ms 7772 KB ok, correct split
5 Correct 2 ms 7772 KB ok, correct split
6 Correct 2 ms 7772 KB ok, correct split
7 Correct 57 ms 22608 KB ok, correct split
8 Correct 55 ms 21072 KB ok, correct split
9 Correct 54 ms 21080 KB ok, correct split
10 Correct 72 ms 22608 KB ok, correct split
11 Correct 60 ms 22860 KB ok, correct split
12 Correct 2 ms 7772 KB ok, correct split
13 Correct 2 ms 7772 KB ok, correct split
14 Correct 2 ms 7772 KB ok, correct split
15 Correct 74 ms 21980 KB ok, correct split
16 Correct 59 ms 18268 KB ok, correct split
17 Correct 61 ms 22864 KB ok, correct split
18 Correct 62 ms 21068 KB ok, correct split
19 Correct 79 ms 21076 KB ok, correct split
20 Correct 53 ms 18060 KB ok, correct split
21 Correct 50 ms 21448 KB ok, correct split
22 Correct 50 ms 21452 KB ok, correct split
23 Correct 54 ms 21792 KB ok, correct split
24 Correct 2 ms 7772 KB ok, correct split
25 Correct 58 ms 18272 KB ok, correct split
26 Correct 22 ms 11868 KB ok, correct split
27 Correct 2 ms 7772 KB ok, correct split
28 Correct 55 ms 19972 KB ok, correct split
29 Correct 56 ms 20052 KB ok, correct split
30 Correct 56 ms 19948 KB ok, correct split
31 Correct 55 ms 20260 KB ok, correct split
32 Correct 55 ms 20060 KB ok, correct split
33 Correct 18 ms 11356 KB ok, no valid answer
34 Correct 26 ms 13136 KB ok, no valid answer
35 Correct 51 ms 20432 KB ok, no valid answer
36 Correct 56 ms 18516 KB ok, no valid answer
37 Correct 52 ms 21964 KB ok, no valid answer
38 Correct 2 ms 7768 KB ok, correct split
39 Correct 2 ms 7772 KB ok, no valid answer
40 Correct 2 ms 7772 KB ok, correct split
41 Correct 2 ms 7852 KB ok, correct split
42 Correct 2 ms 7768 KB ok, correct split
43 Correct 2 ms 7772 KB ok, correct split
44 Correct 2 ms 7772 KB ok, correct split
45 Correct 2 ms 7772 KB ok, correct split
46 Correct 4 ms 8028 KB ok, correct split
47 Correct 4 ms 7976 KB ok, correct split
48 Correct 2 ms 7772 KB ok, correct split
49 Correct 4 ms 8028 KB ok, correct split
50 Correct 2 ms 7772 KB ok, correct split
51 Correct 2 ms 7772 KB ok, correct split
52 Correct 2 ms 7772 KB ok, correct split
53 Correct 2 ms 7768 KB ok, correct split
54 Correct 2 ms 8024 KB ok, correct split
55 Correct 2 ms 7772 KB ok, correct split
56 Correct 2 ms 7772 KB ok, correct split
57 Correct 3 ms 7772 KB ok, correct split
58 Correct 3 ms 8028 KB ok, correct split
59 Correct 3 ms 8192 KB ok, correct split
60 Correct 3 ms 8028 KB ok, correct split
61 Correct 3 ms 8028 KB ok, correct split
62 Correct 4 ms 8172 KB ok, correct split
63 Incorrect 3 ms 8284 KB jury found a solution, contestant did not
64 Halted 0 ms 0 KB -