oj.uz

Submission #603685

# Submission time Handle Problem Language Result Execution time Memory
603685 2022-07-24T09:45:21 Z SeDunion Split the Attractions (IOI19_split) C++17
100 / 100
 116 ms 31216 KB 
#include "split.h"
#include<algorithm>
#include<iostream>
#include<vector>
#include<assert.h>

using namespace std;
const int N = 2e5 + 123;

vector<int>g[N], tg[N];

int used[N];

int n, a, b, c;

vector<int>ans;

int V = -1;

int tin[N], tout[N], timer, sz[N], fup[N], par[N];

void dfs(int v) {
	used[v] = 1;
	sz[v] = 1;
	tin[v] = fup[v] = timer++;
	for (int to : g[v]) {
		if (!used[to]) {
			tg[v].emplace_back(to);
			par[to] = v;
			dfs(to);
			sz[v] += sz[to];
			fup[v] = min(fup[v], fup[to]);
		} else {
			fup[v] = min(fup[v], tin[to]);
		}
	}
	if (sz[v] >= a && V == -1) V = v;
	tout[v] = timer++;
}

bool cmp(int a, int b) {
	return tin[a] < tin[b];
}

bool upper(int a, int b) { return tin[a] <= tin[b] && tout[a] >= tout[b]; } 

int gg[4];

void tree(int v, int c, int &d) {
	if (!d || ans[v] != 3) return;
	--d;
	ans[v] = c;
	for (int to : tg[v]) tree(to, c, d);
}

void eert(int v, int c, int &d) {
	if (!d || ans[v] != 3) return;
	--d;
	ans[v] = c;
	for (int to : g[v]) eert(to, c, d);
}

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 (a > b) swap(a, b);
	if (b > c) swap(b, c);
	if (a > b) swap(a, b);
	if (a_ == a && b_ == b && c_ == c) gg[1] = 1, gg[2] = 2, gg[3] = 3;
	if (a_ == a && b_ == c && c_ == b) gg[1] = 1, gg[3] = 2, gg[2] = 3;
	if (a_ == b && b_ == a && c_ == c) gg[2] = 1, gg[1] = 2, gg[3] = 3;
	if (a_ == b && b_ == c && c_ == a) gg[2] = 1, gg[3] = 2, gg[1] = 3;
	if (a_ == c && b_ == a && c_ == b) gg[3] = 1, gg[1] = 2, gg[2] = 3;
	if (a_ == c && b_ == b && c_ == a) gg[3] = 1, gg[2] = 2, gg[1] = 3;
	// a <= b <= c
	// a <= n/3 ?
	// b <= n/2 ?
	int m = p.size();
	for (int i = 0 ; i < m ; ++ i) {
		g[p[i]].emplace_back(q[i]);
		g[q[i]].emplace_back(p[i]);
	}
	ans = vector<int>(n, 3);
	par[0] = -1;
	dfs(0);
	if (V == -1) return vector<int>(n, 0);
	int v = V;
	if (sz[v] + b <= n) {
		tree(v, 1, a);
		eert(par[v], 2, b);
	} else {
		ans[v] = 2;
		b--;
		for (int to : tg[v]) if (fup[to] > tin[v]) tree(to, 2, b);
		for (int to : tg[v]) if (fup[to] <= tin[v]) tree(to, 2, b);
		if (par[V] != -1) eert(par[v], 1, a);
		if (a) return vector<int>(n, 0);
	}
	for (int &i : ans) i = gg[i];
	return ans;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9684 KB ok, correct split
2 Correct 5 ms 9684 KB ok, correct split
3 Correct 5 ms 9684 KB ok, correct split
4 Correct 6 ms 9800 KB ok, correct split
5 Correct 5 ms 9684 KB ok, correct split
6 Correct 5 ms 9684 KB ok, correct split
7 Correct 92 ms 30648 KB ok, correct split
8 Correct 85 ms 28124 KB ok, correct split
9 Correct 81 ms 27200 KB ok, correct split
10 Correct 89 ms 31216 KB ok, correct split
11 Correct 87 ms 31148 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9700 KB ok, correct split
2 Correct 5 ms 9684 KB ok, correct split
3 Correct 5 ms 9684 KB ok, correct split
4 Correct 96 ms 24976 KB ok, correct split
5 Correct 79 ms 19356 KB ok, correct split
6 Correct 100 ms 31204 KB ok, correct split
7 Correct 88 ms 27752 KB ok, correct split
8 Correct 105 ms 24124 KB ok, correct split
9 Correct 77 ms 21876 KB ok, correct split
10 Correct 50 ms 19280 KB ok, correct split
11 Correct 52 ms 19116 KB ok, correct split
12 Correct 52 ms 19616 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB ok, correct split
2 Correct 94 ms 19192 KB ok, correct split
3 Correct 27 ms 13900 KB ok, correct split
4 Correct 5 ms 9700 KB ok, correct split
5 Correct 87 ms 24936 KB ok, correct split
6 Correct 82 ms 24616 KB ok, correct split
7 Correct 90 ms 24456 KB ok, correct split
8 Correct 82 ms 25932 KB ok, correct split
9 Correct 80 ms 24140 KB ok, correct split
10 Correct 24 ms 13228 KB ok, no valid answer
11 Correct 33 ms 14928 KB ok, no valid answer
12 Correct 58 ms 19944 KB ok, no valid answer
13 Correct 71 ms 20328 KB ok, no valid answer
14 Correct 49 ms 19664 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9684 KB ok, correct split
2 Correct 5 ms 9684 KB ok, no valid answer
3 Correct 5 ms 9684 KB ok, correct split
4 Correct 5 ms 9684 KB ok, correct split
5 Correct 5 ms 9672 KB ok, correct split
6 Correct 5 ms 9684 KB ok, correct split
7 Correct 5 ms 9684 KB ok, correct split
8 Correct 6 ms 9712 KB ok, correct split
9 Correct 7 ms 10116 KB ok, correct split
10 Correct 7 ms 10068 KB ok, correct split
11 Correct 5 ms 9684 KB ok, correct split
12 Correct 8 ms 10040 KB ok, correct split
13 Correct 5 ms 9716 KB ok, correct split
14 Correct 5 ms 9684 KB ok, correct split
15 Correct 5 ms 9716 KB ok, correct split
16 Correct 5 ms 9708 KB ok, correct split
17 Correct 5 ms 9684 KB ok, correct split
18 Correct 5 ms 9712 KB ok, correct split
19 Correct 5 ms 9724 KB ok, correct split
20 Correct 6 ms 9796 KB ok, correct split
21 Correct 6 ms 10068 KB ok, correct split
22 Correct 6 ms 10068 KB ok, correct split
23 Correct 6 ms 10108 KB ok, correct split
24 Correct 7 ms 10068 KB ok, correct split
25 Correct 6 ms 9980 KB ok, correct split
26 Correct 7 ms 9940 KB ok, correct split
27 Correct 7 ms 9976 KB ok, correct split
28 Correct 7 ms 9924 KB ok, correct split
29 Correct 5 ms 9684 KB ok, correct split
30 Correct 6 ms 9980 KB ok, correct split
31 Correct 6 ms 9720 KB ok, correct split
32 Correct 5 ms 9684 KB ok, correct split
33 Correct 6 ms 9684 KB ok, correct split
34 Correct 6 ms 9980 KB ok, correct split
35 Correct 7 ms 9940 KB ok, correct split
36 Correct 6 ms 9940 KB ok, correct split
37 Correct 6 ms 9980 KB ok, correct split
38 Correct 7 ms 10068 KB ok, correct split
39 Correct 7 ms 9976 KB ok, correct split
40 Correct 7 ms 9940 KB ok, correct split
41 Correct 7 ms 9848 KB ok, correct split
42 Correct 6 ms 9812 KB ok, correct split
43 Correct 7 ms 10068 KB ok, correct split
44 Correct 7 ms 10036 KB ok, correct split
45 Correct 7 ms 10068 KB ok, correct split
46 Correct 6 ms 10108 KB ok, correct split
47 Correct 6 ms 10068 KB ok, no valid answer
48 Correct 8 ms 9972 KB ok, correct split
49 Correct 7 ms 10160 KB ok, correct split
50 Correct 6 ms 9648 KB ok, no valid answer
51 Correct 5 ms 9712 KB ok, no valid answer
52 Correct 6 ms 9940 KB ok, no valid answer
53 Correct 7 ms 10068 KB ok, no valid answer
54 Correct 6 ms 9940 KB ok, no valid answer
55 Correct 7 ms 9976 KB ok, no valid answer
56 Correct 7 ms 9940 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9684 KB ok, correct split
2 Correct 5 ms 9684 KB ok, correct split
3 Correct 5 ms 9684 KB ok, correct split
4 Correct 6 ms 9800 KB ok, correct split
5 Correct 5 ms 9684 KB ok, correct split
6 Correct 5 ms 9684 KB ok, correct split
7 Correct 92 ms 30648 KB ok, correct split
8 Correct 85 ms 28124 KB ok, correct split
9 Correct 81 ms 27200 KB ok, correct split
10 Correct 89 ms 31216 KB ok, correct split
11 Correct 87 ms 31148 KB ok, correct split
12 Correct 5 ms 9700 KB ok, correct split
13 Correct 5 ms 9684 KB ok, correct split
14 Correct 5 ms 9684 KB ok, correct split
15 Correct 96 ms 24976 KB ok, correct split
16 Correct 79 ms 19356 KB ok, correct split
17 Correct 100 ms 31204 KB ok, correct split
18 Correct 88 ms 27752 KB ok, correct split
19 Correct 105 ms 24124 KB ok, correct split
20 Correct 77 ms 21876 KB ok, correct split
21 Correct 50 ms 19280 KB ok, correct split
22 Correct 52 ms 19116 KB ok, correct split
23 Correct 52 ms 19616 KB ok, correct split
24 Correct 5 ms 9684 KB ok, correct split
25 Correct 94 ms 19192 KB ok, correct split
26 Correct 27 ms 13900 KB ok, correct split
27 Correct 5 ms 9700 KB ok, correct split
28 Correct 87 ms 24936 KB ok, correct split
29 Correct 82 ms 24616 KB ok, correct split
30 Correct 90 ms 24456 KB ok, correct split
31 Correct 82 ms 25932 KB ok, correct split
32 Correct 80 ms 24140 KB ok, correct split
33 Correct 24 ms 13228 KB ok, no valid answer
34 Correct 33 ms 14928 KB ok, no valid answer
35 Correct 58 ms 19944 KB ok, no valid answer
36 Correct 71 ms 20328 KB ok, no valid answer
37 Correct 49 ms 19664 KB ok, no valid answer
38 Correct 4 ms 9684 KB ok, correct split
39 Correct 5 ms 9684 KB ok, no valid answer
40 Correct 5 ms 9684 KB ok, correct split
41 Correct 5 ms 9684 KB ok, correct split
42 Correct 5 ms 9672 KB ok, correct split
43 Correct 5 ms 9684 KB ok, correct split
44 Correct 5 ms 9684 KB ok, correct split
45 Correct 6 ms 9712 KB ok, correct split
46 Correct 7 ms 10116 KB ok, correct split
47 Correct 7 ms 10068 KB ok, correct split
48 Correct 5 ms 9684 KB ok, correct split
49 Correct 8 ms 10040 KB ok, correct split
50 Correct 5 ms 9716 KB ok, correct split
51 Correct 5 ms 9684 KB ok, correct split
52 Correct 5 ms 9716 KB ok, correct split
53 Correct 5 ms 9708 KB ok, correct split
54 Correct 5 ms 9684 KB ok, correct split
55 Correct 5 ms 9712 KB ok, correct split
56 Correct 5 ms 9724 KB ok, correct split
57 Correct 6 ms 9796 KB ok, correct split
58 Correct 6 ms 10068 KB ok, correct split
59 Correct 6 ms 10068 KB ok, correct split
60 Correct 6 ms 10108 KB ok, correct split
61 Correct 7 ms 10068 KB ok, correct split
62 Correct 6 ms 9980 KB ok, correct split
63 Correct 7 ms 9940 KB ok, correct split
64 Correct 7 ms 9976 KB ok, correct split
65 Correct 7 ms 9924 KB ok, correct split
66 Correct 5 ms 9684 KB ok, correct split
67 Correct 6 ms 9980 KB ok, correct split
68 Correct 6 ms 9720 KB ok, correct split
69 Correct 5 ms 9684 KB ok, correct split
70 Correct 6 ms 9684 KB ok, correct split
71 Correct 6 ms 9980 KB ok, correct split
72 Correct 7 ms 9940 KB ok, correct split
73 Correct 6 ms 9940 KB ok, correct split
74 Correct 6 ms 9980 KB ok, correct split
75 Correct 7 ms 10068 KB ok, correct split
76 Correct 7 ms 9976 KB ok, correct split
77 Correct 7 ms 9940 KB ok, correct split
78 Correct 7 ms 9848 KB ok, correct split
79 Correct 6 ms 9812 KB ok, correct split
80 Correct 7 ms 10068 KB ok, correct split
81 Correct 7 ms 10036 KB ok, correct split
82 Correct 7 ms 10068 KB ok, correct split
83 Correct 6 ms 10108 KB ok, correct split
84 Correct 6 ms 10068 KB ok, no valid answer
85 Correct 8 ms 9972 KB ok, correct split
86 Correct 7 ms 10160 KB ok, correct split
87 Correct 6 ms 9648 KB ok, no valid answer
88 Correct 5 ms 9712 KB ok, no valid answer
89 Correct 6 ms 9940 KB ok, no valid answer
90 Correct 7 ms 10068 KB ok, no valid answer
91 Correct 6 ms 9940 KB ok, no valid answer
92 Correct 7 ms 9976 KB ok, no valid answer
93 Correct 7 ms 9940 KB ok, no valid answer
94 Correct 85 ms 23936 KB ok, correct split
95 Correct 116 ms 29984 KB ok, correct split
96 Correct 107 ms 28060 KB ok, correct split
97 Correct 29 ms 13936 KB ok, correct split
98 Correct 31 ms 14248 KB ok, correct split
99 Correct 42 ms 16844 KB ok, correct split
100 Correct 104 ms 24780 KB ok, correct split
101 Correct 94 ms 23576 KB ok, correct split
102 Correct 90 ms 22856 KB ok, correct split
103 Correct 86 ms 22508 KB ok, correct split
104 Correct 81 ms 22928 KB ok, correct split
105 Correct 41 ms 16304 KB ok, correct split
106 Correct 76 ms 22768 KB ok, correct split
107 Correct 81 ms 20428 KB ok, correct split
108 Correct 79 ms 20428 KB ok, correct split
109 Correct 109 ms 24080 KB ok, correct split
110 Correct 105 ms 24900 KB ok, correct split
111 Correct 103 ms 24940 KB ok, correct split
112 Correct 106 ms 23640 KB ok, correct split
113 Correct 107 ms 23720 KB ok, correct split
114 Correct 13 ms 11476 KB ok, correct split
115 Correct 13 ms 11220 KB ok, correct split
116 Correct 97 ms 24820 KB ok, correct split
117 Correct 95 ms 24760 KB ok, correct split
118 Correct 80 ms 21868 KB ok, correct split
119 Correct 78 ms 21836 KB ok, correct split
120 Correct 81 ms 26740 KB ok, correct split
121 Correct 74 ms 20484 KB ok, no valid answer
122 Correct 65 ms 20340 KB ok, no valid answer
123 Correct 114 ms 24948 KB ok, no valid answer
124 Correct 108 ms 24828 KB ok, no valid answer
125 Correct 67 ms 21216 KB ok, no valid answer
126 Correct 50 ms 18580 KB ok, no valid answer
127 Correct 77 ms 22112 KB ok, no valid answer