oj.uz

Submission #984329

# Submission time Handle Problem Language Result Execution time Memory
984329 2024-05-16T13:34:18 Z michified Split the Attractions (IOI19_split) C++17
100 / 100
 178 ms 50848 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;

struct node_t {
	int ord, low, ss, par;
	vector<int> adj, childs;
	unordered_set<int> used;
};

vector<node_t> nodes;
vector<int> thing, ord2id, ans;
int lo, t = 0, n, remain;
bool good = true;
pair<int, int> found = {-1, -1};

void dfs(int cur, int par) {
	if (not good) return;
	node_t& u = nodes[cur];
	u.par = par;
	t++;
	u.ord = u.low = t;
	u.ss = 1;
	ord2id[t] = cur;
	for (int v : u.adj) {
		if (not nodes[v].ord) {
			dfs(v, cur);
			u.low = min(u.low, nodes[v].low);
			u.used.insert(v);
			nodes[v].used.insert(cur);
			u.ss += nodes[v].ss;
			u.childs.push_back(v);
		} else if (v != par) {
			u.low = min(u.low, nodes[v].ord);
		} 
	}
}

void findSplit(int cur, int par) {
	node_t& u = nodes[cur];
	int mcss = 0;
	for (int v : u.childs) {
		if (v == par) continue;
		findSplit(v, cur);
		mcss = max(mcss, nodes[v].ss);
	}
	if (found.first != -1) return;
	if (mcss < lo and u.ss >= lo) {
		if (par == -1) {
			good = false;
			return;
		}
		if (u.ss <= n - lo) {
			u.used.erase(par);
			nodes[par].used.erase(cur);
			found = make_pair(cur, par);
			return;
		}
		int curss = u.ss;
		for (int v : u.childs) {
			if (v == par) continue;
			if (nodes[v].low < u.ord) {
				curss -= nodes[v].ss;
				u.used.erase(v);
				nodes[v].used.erase(cur);
				nodes[ord2id[nodes[v].low]].used.insert(v);
				nodes[v].used.insert(ord2id[nodes[v].low]);
				if (curss <= n - lo) { 
					u.used.erase(par);
					nodes[par].used.erase(cur);
					found = make_pair(cur, par);
					return;
				}
			}
		}
		good = false;
	} 
}

bool construct(int cur, int group, int par) {
	if (remain == 0) return true;
	ans[cur] = group;
	remain--;
	bool res = false;
	for (int v : nodes[cur].used) {
		if (v == par) continue;
		res = res or construct(v, group, cur);
	}
	return res;
}

vector<int> find_split(int N, int a, int b, int c, vector<int> p, vector<int> q) {
	int i;
	n = N;
	nodes.resize(n);
	ord2id.resize(n + 1);
	lo = min(min(a, b), c);
	vector<pair<int, int>> thing = {{a, 1}, {b, 2}, {c, 3}};
	sort(thing.begin(), thing.end());
	for (i = 0; i < q.size(); i++) {
		nodes[p[i]].adj.push_back(q[i]);
		nodes[q[i]].adj.push_back(p[i]);
	}
	dfs(0, -1);
	findSplit(0, -1);
	ans.resize(n);
	if (not good) return ans;
	remain = thing[1].first;
	bool ok = construct(found.first, thing[1].second, -1);
	if (not ok) {
		remain = thing[1].first;
		construct(found.first, 0, -1);
		remain = thing[0].first;
		construct(found.first, thing[0].second, -1);
		remain = thing[1].first;
		construct(found.second, thing[1].second, -1);
	} else {
		remain = thing[0].first;
		construct(found.second, thing[0].second, -1);
	}
	for (i = 0; i < n; i++) {
		if (ans[i] == 0) ans[i] = thing[2].second;
	}
	return ans;
}

Compilation message

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:100:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |  for (i = 0; i < q.size(); i++) {
      |              ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB ok, correct split
2 Correct 0 ms 600 KB ok, correct split
3 Correct 0 ms 348 KB ok, correct split
4 Correct 0 ms 348 KB ok, correct split
5 Correct 1 ms 348 KB ok, correct split
6 Correct 1 ms 344 KB ok, correct split
7 Correct 145 ms 50260 KB ok, correct split
8 Correct 138 ms 46676 KB ok, correct split
9 Correct 140 ms 45392 KB ok, correct split
10 Correct 133 ms 50848 KB ok, correct split
11 Correct 146 ms 50776 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB ok, correct split
2 Correct 0 ms 348 KB ok, correct split
3 Correct 0 ms 348 KB ok, correct split
4 Correct 151 ms 44120 KB ok, correct split
5 Correct 116 ms 36944 KB ok, correct split
6 Correct 132 ms 50664 KB ok, correct split
7 Correct 134 ms 46160 KB ok, correct split
8 Correct 145 ms 39504 KB ok, correct split
9 Correct 140 ms 38480 KB ok, correct split
10 Correct 108 ms 37344 KB ok, correct split
11 Correct 109 ms 37172 KB ok, correct split
12 Correct 105 ms 37344 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok, correct split
2 Correct 115 ms 36808 KB ok, correct split
3 Correct 33 ms 14932 KB ok, correct split
4 Correct 1 ms 348 KB ok, correct split
5 Correct 171 ms 42460 KB ok, correct split
6 Correct 138 ms 42136 KB ok, correct split
7 Correct 128 ms 41812 KB ok, correct split
8 Correct 161 ms 43856 KB ok, correct split
9 Correct 133 ms 41552 KB ok, correct split
10 Correct 27 ms 12496 KB ok, no valid answer
11 Correct 45 ms 18592 KB ok, no valid answer
12 Correct 105 ms 36936 KB ok, no valid answer
13 Correct 145 ms 36948 KB ok, no valid answer
14 Correct 107 ms 37368 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok, correct split
2 Correct 0 ms 348 KB ok, no valid answer
3 Correct 0 ms 348 KB ok, correct split
4 Correct 0 ms 348 KB ok, correct split
5 Correct 0 ms 348 KB ok, correct split
6 Correct 1 ms 348 KB ok, correct split
7 Correct 1 ms 348 KB ok, correct split
8 Correct 0 ms 348 KB ok, correct split
9 Correct 3 ms 1372 KB ok, correct split
10 Correct 3 ms 1396 KB ok, correct split
11 Correct 1 ms 348 KB ok, correct split
12 Correct 3 ms 1372 KB ok, correct split
13 Correct 0 ms 348 KB ok, correct split
14 Correct 0 ms 348 KB ok, correct split
15 Correct 0 ms 348 KB ok, correct split
16 Correct 0 ms 348 KB ok, correct split
17 Correct 0 ms 348 KB ok, correct split
18 Correct 0 ms 344 KB ok, correct split
19 Correct 1 ms 604 KB ok, correct split
20 Correct 1 ms 604 KB ok, correct split
21 Correct 3 ms 1372 KB ok, correct split
22 Correct 3 ms 1372 KB ok, correct split
23 Correct 2 ms 1368 KB ok, correct split
24 Correct 2 ms 1372 KB ok, correct split
25 Correct 2 ms 1372 KB ok, correct split
26 Correct 3 ms 1372 KB ok, correct split
27 Correct 3 ms 1372 KB ok, correct split
28 Correct 3 ms 1372 KB ok, correct split
29 Correct 1 ms 348 KB ok, correct split
30 Correct 2 ms 1372 KB ok, correct split
31 Correct 1 ms 344 KB ok, correct split
32 Correct 1 ms 348 KB ok, correct split
33 Correct 1 ms 348 KB ok, correct split
34 Correct 2 ms 1196 KB ok, correct split
35 Correct 2 ms 1116 KB ok, correct split
36 Correct 2 ms 1116 KB ok, correct split
37 Correct 3 ms 1372 KB ok, correct split
38 Correct 3 ms 1368 KB ok, correct split
39 Correct 3 ms 1372 KB ok, correct split
40 Correct 3 ms 1372 KB ok, correct split
41 Correct 2 ms 860 KB ok, correct split
42 Correct 2 ms 860 KB ok, correct split
43 Correct 3 ms 1372 KB ok, correct split
44 Correct 3 ms 1372 KB ok, correct split
45 Correct 3 ms 1372 KB ok, correct split
46 Correct 2 ms 1368 KB ok, correct split
47 Correct 2 ms 1372 KB ok, no valid answer
48 Correct 2 ms 1368 KB ok, correct split
49 Correct 2 ms 1372 KB ok, correct split
50 Correct 0 ms 348 KB ok, no valid answer
51 Correct 0 ms 344 KB ok, no valid answer
52 Correct 2 ms 1372 KB ok, no valid answer
53 Correct 3 ms 1372 KB ok, no valid answer
54 Correct 2 ms 1372 KB ok, no valid answer
55 Correct 2 ms 1372 KB ok, no valid answer
56 Correct 2 ms 1372 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB ok, correct split
2 Correct 0 ms 600 KB ok, correct split
3 Correct 0 ms 348 KB ok, correct split
4 Correct 0 ms 348 KB ok, correct split
5 Correct 1 ms 348 KB ok, correct split
6 Correct 1 ms 344 KB ok, correct split
7 Correct 145 ms 50260 KB ok, correct split
8 Correct 138 ms 46676 KB ok, correct split
9 Correct 140 ms 45392 KB ok, correct split
10 Correct 133 ms 50848 KB ok, correct split
11 Correct 146 ms 50776 KB ok, correct split
12 Correct 1 ms 348 KB ok, correct split
13 Correct 0 ms 348 KB ok, correct split
14 Correct 0 ms 348 KB ok, correct split
15 Correct 151 ms 44120 KB ok, correct split
16 Correct 116 ms 36944 KB ok, correct split
17 Correct 132 ms 50664 KB ok, correct split
18 Correct 134 ms 46160 KB ok, correct split
19 Correct 145 ms 39504 KB ok, correct split
20 Correct 140 ms 38480 KB ok, correct split
21 Correct 108 ms 37344 KB ok, correct split
22 Correct 109 ms 37172 KB ok, correct split
23 Correct 105 ms 37344 KB ok, correct split
24 Correct 0 ms 348 KB ok, correct split
25 Correct 115 ms 36808 KB ok, correct split
26 Correct 33 ms 14932 KB ok, correct split
27 Correct 1 ms 348 KB ok, correct split
28 Correct 171 ms 42460 KB ok, correct split
29 Correct 138 ms 42136 KB ok, correct split
30 Correct 128 ms 41812 KB ok, correct split
31 Correct 161 ms 43856 KB ok, correct split
32 Correct 133 ms 41552 KB ok, correct split
33 Correct 27 ms 12496 KB ok, no valid answer
34 Correct 45 ms 18592 KB ok, no valid answer
35 Correct 105 ms 36936 KB ok, no valid answer
36 Correct 145 ms 36948 KB ok, no valid answer
37 Correct 107 ms 37368 KB ok, no valid answer
38 Correct 0 ms 348 KB ok, correct split
39 Correct 0 ms 348 KB ok, no valid answer
40 Correct 0 ms 348 KB ok, correct split
41 Correct 0 ms 348 KB ok, correct split
42 Correct 0 ms 348 KB ok, correct split
43 Correct 1 ms 348 KB ok, correct split
44 Correct 1 ms 348 KB ok, correct split
45 Correct 0 ms 348 KB ok, correct split
46 Correct 3 ms 1372 KB ok, correct split
47 Correct 3 ms 1396 KB ok, correct split
48 Correct 1 ms 348 KB ok, correct split
49 Correct 3 ms 1372 KB ok, correct split
50 Correct 0 ms 348 KB ok, correct split
51 Correct 0 ms 348 KB ok, correct split
52 Correct 0 ms 348 KB ok, correct split
53 Correct 0 ms 348 KB ok, correct split
54 Correct 0 ms 348 KB ok, correct split
55 Correct 0 ms 344 KB ok, correct split
56 Correct 1 ms 604 KB ok, correct split
57 Correct 1 ms 604 KB ok, correct split
58 Correct 3 ms 1372 KB ok, correct split
59 Correct 3 ms 1372 KB ok, correct split
60 Correct 2 ms 1368 KB ok, correct split
61 Correct 2 ms 1372 KB ok, correct split
62 Correct 2 ms 1372 KB ok, correct split
63 Correct 3 ms 1372 KB ok, correct split
64 Correct 3 ms 1372 KB ok, correct split
65 Correct 3 ms 1372 KB ok, correct split
66 Correct 1 ms 348 KB ok, correct split
67 Correct 2 ms 1372 KB ok, correct split
68 Correct 1 ms 344 KB ok, correct split
69 Correct 1 ms 348 KB ok, correct split
70 Correct 1 ms 348 KB ok, correct split
71 Correct 2 ms 1196 KB ok, correct split
72 Correct 2 ms 1116 KB ok, correct split
73 Correct 2 ms 1116 KB ok, correct split
74 Correct 3 ms 1372 KB ok, correct split
75 Correct 3 ms 1368 KB ok, correct split
76 Correct 3 ms 1372 KB ok, correct split
77 Correct 3 ms 1372 KB ok, correct split
78 Correct 2 ms 860 KB ok, correct split
79 Correct 2 ms 860 KB ok, correct split
80 Correct 3 ms 1372 KB ok, correct split
81 Correct 3 ms 1372 KB ok, correct split
82 Correct 3 ms 1372 KB ok, correct split
83 Correct 2 ms 1368 KB ok, correct split
84 Correct 2 ms 1372 KB ok, no valid answer
85 Correct 2 ms 1368 KB ok, correct split
86 Correct 2 ms 1372 KB ok, correct split
87 Correct 0 ms 348 KB ok, no valid answer
88 Correct 0 ms 344 KB ok, no valid answer
89 Correct 2 ms 1372 KB ok, no valid answer
90 Correct 3 ms 1372 KB ok, no valid answer
91 Correct 2 ms 1372 KB ok, no valid answer
92 Correct 2 ms 1372 KB ok, no valid answer
93 Correct 2 ms 1372 KB ok, no valid answer
94 Correct 138 ms 41128 KB ok, correct split
95 Correct 174 ms 47188 KB ok, correct split
96 Correct 165 ms 45328 KB ok, correct split
97 Correct 34 ms 14932 KB ok, correct split
98 Correct 36 ms 15196 KB ok, correct split
99 Correct 44 ms 14772 KB ok, correct split
100 Correct 149 ms 40152 KB ok, correct split
101 Correct 140 ms 39508 KB ok, correct split
102 Correct 138 ms 38856 KB ok, correct split
103 Correct 140 ms 38600 KB ok, correct split
104 Correct 131 ms 38940 KB ok, correct split
105 Correct 68 ms 22608 KB ok, correct split
106 Correct 160 ms 42332 KB ok, correct split
107 Correct 120 ms 37972 KB ok, correct split
108 Correct 140 ms 37968 KB ok, correct split
109 Correct 165 ms 41808 KB ok, correct split
110 Correct 154 ms 42648 KB ok, correct split
111 Correct 158 ms 42800 KB ok, correct split
112 Correct 178 ms 41288 KB ok, correct split
113 Correct 158 ms 41224 KB ok, correct split
114 Correct 12 ms 4968 KB ok, correct split
115 Correct 11 ms 4700 KB ok, correct split
116 Correct 160 ms 42604 KB ok, correct split
117 Correct 161 ms 42444 KB ok, correct split
118 Correct 127 ms 39552 KB ok, correct split
119 Correct 142 ms 39568 KB ok, correct split
120 Correct 146 ms 46136 KB ok, correct split
121 Correct 116 ms 37712 KB ok, no valid answer
122 Correct 126 ms 38316 KB ok, no valid answer
123 Correct 169 ms 42940 KB ok, no valid answer
124 Correct 175 ms 42548 KB ok, no valid answer
125 Correct 123 ms 39292 KB ok, no valid answer
126 Correct 92 ms 34784 KB ok, no valid answer
127 Correct 153 ms 40480 KB ok, no valid answer