oj.uz

Submission #585756

# Submission time Handle Problem Language Result Execution time Memory
585756 2022-06-29T09:59:27 Z Lucpp Split the Attractions (IOI19_split) C++17
100 / 100
 118 ms 27152 KB 
#include "split.h"
#include <bits/stdc++.h>
using namespace std;

int N, A;

vector<vector<int>> g;
vector<int> num, low;
int dfs_cnt = 0;
bool possible = false;
vector<bool> comp;

void revisit(int u){
	comp[u] = true;
	for(int v : g[u]){
		if(!comp[v] && num[v] > num[u]) revisit(v);
	}
}

int dfs(int u, int par){
	num[u] = low[u] = dfs_cnt++;
	vector<pair<int, int>> must, can;
	int max_subtree = 0;
	for(int v : g[u]){
		if(v == par) continue;
		if(num[v] == -1){
			int size = dfs(v, u);
			max_subtree = max(max_subtree, size);
			if(size == -1) return -1; // answer already found
			low[u] = min(low[u], low[v]);
			if(num[u] <= low[v]) must.emplace_back(size, v);
			else can.emplace_back(size, v);
		}
		else low[u] = min(low[u], num[v]);
	}
	int min_size = 1, max_size = 1;
	for(auto [s, v] : must) min_size += s, max_size += s;
	for(auto [s, v] : can) max_size += s;
	if(min_size <= N-A && max_size >= A && max_subtree < A){
		int size = min_size;
		possible = true;
		comp[u] = true;
		for(auto [s, v] : must) revisit(v);
		for(auto [s, v] : can){
			if(size >= A) break;
			size += s;
			revisit(v);
		}
		return -1;
	}
	return max_size;
}

vector<pair<int, int>> bySize;
vector<int> ans;
vector<bool> vis;
int cnt = 0, cur;
void dfs2(int u){
	vis[u] = true;
	if(cnt < bySize[cur].first){
		cnt++;
		ans[u] = bySize[cur].second;
	}
	else ans[u] = bySize[2].second;
	for(int v : g[u]){
		if(!vis[v] && comp[u] == comp[v]){
			dfs2(v);
		}
	}
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	bySize = {{a, 1}, {b, 2}, {c, 3}};
	sort(bySize.begin(), bySize.end());
	g.resize(n);
	for(int i = 0; i < (int)p.size(); i++){
		g[p[i]].push_back(q[i]);
		g[q[i]].push_back(p[i]);
	}
	N = n;
	A = bySize[0].first;
	num.assign(n, -1);
	low.resize(n);
	comp.resize(n);
	dfs(0, -1);
	if(!possible) return vector<int>(n, 0);
	else{
		ans.resize(n);
		int cn = 0;
		for(int i = 0; i < n; i++) cn += comp[i];
		if(cn < n/2) swap(bySize[0], bySize[1]);
		for(int i = 0; i < 2; i++){
			cur = i; cnt = 0;
			vis.assign(n, false);
			for(int u = 0; u < n; u++){
				if(comp[u] == i){
					dfs2(u);
					break;
				}
			}
		}
		return ans;
	}
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Correct 0 ms 212 KB ok, correct split
4 Correct 0 ms 212 KB ok, correct split
5 Correct 0 ms 212 KB ok, correct split
6 Correct 1 ms 212 KB ok, correct split
7 Correct 82 ms 26384 KB ok, correct split
8 Correct 58 ms 15692 KB ok, correct split
9 Correct 62 ms 17328 KB ok, correct split
10 Correct 88 ms 27148 KB ok, correct split
11 Correct 91 ms 27152 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Correct 0 ms 212 KB ok, correct split
4 Correct 69 ms 12088 KB ok, correct split
5 Correct 51 ms 8956 KB ok, correct split
6 Correct 73 ms 26132 KB ok, correct split
7 Correct 65 ms 19788 KB ok, correct split
8 Correct 86 ms 11188 KB ok, correct split
9 Correct 68 ms 9056 KB ok, correct split
10 Correct 36 ms 9276 KB ok, correct split
11 Correct 39 ms 9284 KB ok, correct split
12 Correct 37 ms 9268 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 61 ms 9012 KB ok, correct split
3 Correct 19 ms 4284 KB ok, correct split
4 Correct 1 ms 212 KB ok, correct split
5 Correct 94 ms 15748 KB ok, correct split
6 Correct 67 ms 15220 KB ok, correct split
7 Correct 75 ms 14796 KB ok, correct split
8 Correct 93 ms 17816 KB ok, correct split
9 Correct 98 ms 14380 KB ok, correct split
10 Correct 16 ms 3412 KB ok, no valid answer
11 Correct 23 ms 5044 KB ok, no valid answer
12 Correct 47 ms 10280 KB ok, no valid answer
13 Correct 55 ms 9820 KB ok, no valid answer
14 Correct 44 ms 10752 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 1 ms 212 KB ok, no valid answer
3 Correct 1 ms 212 KB ok, correct split
4 Correct 0 ms 212 KB ok, correct split
5 Correct 1 ms 212 KB ok, correct split
6 Correct 0 ms 300 KB ok, correct split
7 Correct 0 ms 212 KB ok, correct split
8 Correct 1 ms 212 KB ok, correct split
9 Correct 4 ms 736 KB ok, correct split
10 Correct 2 ms 596 KB ok, correct split
11 Correct 1 ms 300 KB ok, correct split
12 Correct 2 ms 596 KB ok, correct split
13 Correct 1 ms 212 KB ok, correct split
14 Correct 1 ms 212 KB ok, correct split
15 Correct 1 ms 212 KB ok, correct split
16 Correct 1 ms 212 KB ok, correct split
17 Correct 1 ms 212 KB ok, correct split
18 Correct 1 ms 212 KB ok, correct split
19 Correct 1 ms 340 KB ok, correct split
20 Correct 2 ms 468 KB ok, correct split
21 Correct 2 ms 596 KB ok, correct split
22 Correct 2 ms 596 KB ok, correct split
23 Correct 2 ms 692 KB ok, correct split
24 Correct 2 ms 596 KB ok, correct split
25 Correct 2 ms 596 KB ok, correct split
26 Correct 2 ms 596 KB ok, correct split
27 Correct 2 ms 596 KB ok, correct split
28 Correct 2 ms 596 KB ok, correct split
29 Correct 1 ms 304 KB ok, correct split
30 Correct 2 ms 596 KB ok, correct split
31 Correct 1 ms 312 KB ok, correct split
32 Correct 1 ms 296 KB ok, correct split
33 Correct 1 ms 348 KB ok, correct split
34 Correct 2 ms 468 KB ok, correct split
35 Correct 3 ms 468 KB ok, correct split
36 Correct 2 ms 468 KB ok, correct split
37 Correct 3 ms 596 KB ok, correct split
38 Correct 3 ms 596 KB ok, correct split
39 Correct 2 ms 568 KB ok, correct split
40 Correct 3 ms 568 KB ok, correct split
41 Correct 1 ms 340 KB ok, correct split
42 Correct 1 ms 468 KB ok, correct split
43 Correct 2 ms 596 KB ok, correct split
44 Correct 3 ms 516 KB ok, correct split
45 Correct 3 ms 596 KB ok, correct split
46 Correct 3 ms 724 KB ok, correct split
47 Correct 3 ms 596 KB ok, no valid answer
48 Correct 2 ms 468 KB ok, correct split
49 Correct 2 ms 692 KB ok, correct split
50 Correct 1 ms 300 KB ok, no valid answer
51 Correct 1 ms 304 KB ok, no valid answer
52 Correct 2 ms 468 KB ok, no valid answer
53 Correct 3 ms 596 KB ok, no valid answer
54 Correct 1 ms 468 KB ok, no valid answer
55 Correct 2 ms 468 KB ok, no valid answer
56 Correct 2 ms 468 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Correct 0 ms 212 KB ok, correct split
4 Correct 0 ms 212 KB ok, correct split
5 Correct 0 ms 212 KB ok, correct split
6 Correct 1 ms 212 KB ok, correct split
7 Correct 82 ms 26384 KB ok, correct split
8 Correct 58 ms 15692 KB ok, correct split
9 Correct 62 ms 17328 KB ok, correct split
10 Correct 88 ms 27148 KB ok, correct split
11 Correct 91 ms 27152 KB ok, correct split
12 Correct 0 ms 212 KB ok, correct split
13 Correct 0 ms 212 KB ok, correct split
14 Correct 0 ms 212 KB ok, correct split
15 Correct 69 ms 12088 KB ok, correct split
16 Correct 51 ms 8956 KB ok, correct split
17 Correct 73 ms 26132 KB ok, correct split
18 Correct 65 ms 19788 KB ok, correct split
19 Correct 86 ms 11188 KB ok, correct split
20 Correct 68 ms 9056 KB ok, correct split
21 Correct 36 ms 9276 KB ok, correct split
22 Correct 39 ms 9284 KB ok, correct split
23 Correct 37 ms 9268 KB ok, correct split
24 Correct 0 ms 212 KB ok, correct split
25 Correct 61 ms 9012 KB ok, correct split
26 Correct 19 ms 4284 KB ok, correct split
27 Correct 1 ms 212 KB ok, correct split
28 Correct 94 ms 15748 KB ok, correct split
29 Correct 67 ms 15220 KB ok, correct split
30 Correct 75 ms 14796 KB ok, correct split
31 Correct 93 ms 17816 KB ok, correct split
32 Correct 98 ms 14380 KB ok, correct split
33 Correct 16 ms 3412 KB ok, no valid answer
34 Correct 23 ms 5044 KB ok, no valid answer
35 Correct 47 ms 10280 KB ok, no valid answer
36 Correct 55 ms 9820 KB ok, no valid answer
37 Correct 44 ms 10752 KB ok, no valid answer
38 Correct 0 ms 212 KB ok, correct split
39 Correct 1 ms 212 KB ok, no valid answer
40 Correct 1 ms 212 KB ok, correct split
41 Correct 0 ms 212 KB ok, correct split
42 Correct 1 ms 212 KB ok, correct split
43 Correct 0 ms 300 KB ok, correct split
44 Correct 0 ms 212 KB ok, correct split
45 Correct 1 ms 212 KB ok, correct split
46 Correct 4 ms 736 KB ok, correct split
47 Correct 2 ms 596 KB ok, correct split
48 Correct 1 ms 300 KB ok, correct split
49 Correct 2 ms 596 KB ok, correct split
50 Correct 1 ms 212 KB ok, correct split
51 Correct 1 ms 212 KB ok, correct split
52 Correct 1 ms 212 KB ok, correct split
53 Correct 1 ms 212 KB ok, correct split
54 Correct 1 ms 212 KB ok, correct split
55 Correct 1 ms 212 KB ok, correct split
56 Correct 1 ms 340 KB ok, correct split
57 Correct 2 ms 468 KB ok, correct split
58 Correct 2 ms 596 KB ok, correct split
59 Correct 2 ms 596 KB ok, correct split
60 Correct 2 ms 692 KB ok, correct split
61 Correct 2 ms 596 KB ok, correct split
62 Correct 2 ms 596 KB ok, correct split
63 Correct 2 ms 596 KB ok, correct split
64 Correct 2 ms 596 KB ok, correct split
65 Correct 2 ms 596 KB ok, correct split
66 Correct 1 ms 304 KB ok, correct split
67 Correct 2 ms 596 KB ok, correct split
68 Correct 1 ms 312 KB ok, correct split
69 Correct 1 ms 296 KB ok, correct split
70 Correct 1 ms 348 KB ok, correct split
71 Correct 2 ms 468 KB ok, correct split
72 Correct 3 ms 468 KB ok, correct split
73 Correct 2 ms 468 KB ok, correct split
74 Correct 3 ms 596 KB ok, correct split
75 Correct 3 ms 596 KB ok, correct split
76 Correct 2 ms 568 KB ok, correct split
77 Correct 3 ms 568 KB ok, correct split
78 Correct 1 ms 340 KB ok, correct split
79 Correct 1 ms 468 KB ok, correct split
80 Correct 2 ms 596 KB ok, correct split
81 Correct 3 ms 516 KB ok, correct split
82 Correct 3 ms 596 KB ok, correct split
83 Correct 3 ms 724 KB ok, correct split
84 Correct 3 ms 596 KB ok, no valid answer
85 Correct 2 ms 468 KB ok, correct split
86 Correct 2 ms 692 KB ok, correct split
87 Correct 1 ms 300 KB ok, no valid answer
88 Correct 1 ms 304 KB ok, no valid answer
89 Correct 2 ms 468 KB ok, no valid answer
90 Correct 3 ms 596 KB ok, no valid answer
91 Correct 1 ms 468 KB ok, no valid answer
92 Correct 2 ms 468 KB ok, no valid answer
93 Correct 2 ms 468 KB ok, no valid answer
94 Correct 72 ms 15692 KB ok, correct split
95 Correct 118 ms 24028 KB ok, correct split
96 Correct 116 ms 21580 KB ok, correct split
97 Correct 19 ms 4276 KB ok, correct split
98 Correct 19 ms 4352 KB ok, correct split
99 Correct 40 ms 7876 KB ok, correct split
100 Correct 112 ms 14400 KB ok, correct split
101 Correct 72 ms 13144 KB ok, correct split
102 Correct 63 ms 12204 KB ok, correct split
103 Correct 64 ms 12100 KB ok, correct split
104 Correct 77 ms 13636 KB ok, correct split
105 Correct 40 ms 6476 KB ok, correct split
106 Correct 81 ms 13860 KB ok, correct split
107 Correct 67 ms 10164 KB ok, correct split
108 Correct 71 ms 10188 KB ok, correct split
109 Correct 91 ms 13432 KB ok, correct split
110 Correct 87 ms 13152 KB ok, correct split
111 Correct 111 ms 13356 KB ok, correct split
112 Correct 101 ms 13500 KB ok, correct split
113 Correct 93 ms 13504 KB ok, correct split
114 Correct 10 ms 2232 KB ok, correct split
115 Correct 8 ms 1848 KB ok, correct split
116 Correct 85 ms 13088 KB ok, correct split
117 Correct 90 ms 13084 KB ok, correct split
118 Correct 70 ms 10284 KB ok, correct split
119 Correct 57 ms 10272 KB ok, correct split
120 Correct 80 ms 19212 KB ok, correct split
121 Correct 64 ms 9784 KB ok, no valid answer
122 Correct 51 ms 9936 KB ok, no valid answer
123 Correct 93 ms 14524 KB ok, no valid answer
124 Correct 89 ms 14132 KB ok, no valid answer
125 Correct 58 ms 11636 KB ok, no valid answer
126 Correct 36 ms 9844 KB ok, no valid answer
127 Correct 68 ms 11716 KB ok, no valid answer