oj.uz

Submission #995615

# Submission time Handle Problem Language Result Execution time Memory
995615 2024-06-09T13:07:47 Z avighna September (APIO24_september) C++17
100 / 100
 274 ms 16840 KB 
#include "september.h"

#include <bits/stdc++.h>

int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
	std::vector<std::vector<int>> sizes(M, std::vector<int>(N));
	std::vector<std::vector<bool>> is_leaf(M, std::vector<bool>(N));
	std::vector<std::vector<int>> adj(N);
	for (int i = 1; i < N; ++ i) {
		for (int j = 0; j < M; ++ j) {
			sizes[j][i]++;
			sizes[j][F[i]]++;
		}
		adj[i].push_back(F[i]);
		adj[F[i]].push_back(i);
	}

	std::vector<std::vector<int>> pos(M, std::vector<int>(N));
	for (int j = 0; j < M; ++ j) {
		for (int i = 0; i < N - 1; ++ i) {
			pos[j][S[j][i]] = i;
		}
	}

	std::vector<std::set<std::pair<bool, std::pair<int, int>>>> sts(M);

	for (int i = 1; i < N; ++ i) {
		for (int j = 0; j < M; ++ j) {
			if (sizes[j][i] == 1) {
				is_leaf[j][i] = true;
			}
		}
	}

	int ans = 0;
	std::vector<std::vector<bool>> removed(M, std::vector<bool>(N));
	std::vector<std::vector<bool>> queued(M, std::vector<bool>(N));
	std::vector<int> listPtrs(M);
	for (int i = 0; i < N - 1; ++ i) {
		int end_at = i;
		std::queue<int> q;
		for (int j = 0; j < M; ++ j) {
			q.push(S[j][listPtrs[j]]);
		}
		while (!q.empty()) {
			int node = q.front();
			q.pop();
			for (int j = 0; j < M; ++ j) {
				sts[j].insert({!is_leaf[j][node], {pos[j][node], node}});
				queued[j][node] = true;
				end_at = std::max(end_at, pos[j][node]);
			}
			for (int j = 0; j < M; ++ j) {
				for (; listPtrs[j] <= end_at; ++ listPtrs[j]) {
					q.push(S[j][listPtrs[j]]);
				}
			}
		}
		i = end_at;
		int cur = 0;
		for (int j = 0; j < M; ++ j) {
			auto &st = sts[j];
			while (!st.empty()) {
				auto p = *st.begin();
				if (p.first) {
					break;
				}
				int node = p.second.second;
				st.erase(st.begin());

				for (auto &i : adj[node]) {
					if (!removed[j][i]) {
						sizes[j][i]--;
					}
				}
				sizes[j][node] = 0;
				removed[j][node] = true;

				for (auto &i : adj[node]) {
					if (i != 0 && sizes[j][i] == 1) {
						is_leaf[j][i] = true;
						if (queued[j][i]) {
							st.erase({!false, {pos[j][i], i}});
							st.insert({!true, {pos[j][i], i}});
						}
					}
				}
			}
			if (st.empty()) {
				cur++;
			}
		}
		ans += cur == M;
	}

	return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 3 ms 476 KB Output is correct
6 Correct 2 ms 472 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 3 ms 604 KB Output is correct
26 Correct 3 ms 476 KB Output is correct
27 Correct 2 ms 472 KB Output is correct
28 Correct 2 ms 600 KB Output is correct
29 Correct 3 ms 604 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 3 ms 608 KB Output is correct
32 Correct 2 ms 608 KB Output is correct
33 Correct 4 ms 604 KB Output is correct
34 Correct 2 ms 604 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 200 ms 12068 KB Output is correct
5 Correct 207 ms 11592 KB Output is correct
6 Correct 189 ms 11512 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 200 ms 12068 KB Output is correct
19 Correct 207 ms 11592 KB Output is correct
20 Correct 189 ms 11512 KB Output is correct
21 Correct 274 ms 11756 KB Output is correct
22 Correct 258 ms 10992 KB Output is correct
23 Correct 222 ms 12292 KB Output is correct
24 Correct 241 ms 11732 KB Output is correct
25 Correct 245 ms 12204 KB Output is correct
26 Correct 250 ms 12052 KB Output is correct
27 Correct 228 ms 9656 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 3 ms 476 KB Output is correct
6 Correct 2 ms 472 KB Output is correct
7 Correct 200 ms 12068 KB Output is correct
8 Correct 207 ms 11592 KB Output is correct
9 Correct 189 ms 11512 KB Output is correct
10 Correct 180 ms 15304 KB Output is correct
11 Correct 174 ms 15376 KB Output is correct
12 Correct 173 ms 16372 KB Output is correct

Subtask #10
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 3 ms 604 KB Output is correct
26 Correct 3 ms 476 KB Output is correct
27 Correct 2 ms 472 KB Output is correct
28 Correct 2 ms 600 KB Output is correct
29 Correct 3 ms 604 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 3 ms 608 KB Output is correct
32 Correct 2 ms 608 KB Output is correct
33 Correct 4 ms 604 KB Output is correct
34 Correct 2 ms 604 KB Output is correct
35 Correct 200 ms 12068 KB Output is correct
36 Correct 207 ms 11592 KB Output is correct
37 Correct 189 ms 11512 KB Output is correct
38 Correct 274 ms 11756 KB Output is correct
39 Correct 258 ms 10992 KB Output is correct
40 Correct 222 ms 12292 KB Output is correct
41 Correct 241 ms 11732 KB Output is correct
42 Correct 245 ms 12204 KB Output is correct
43 Correct 250 ms 12052 KB Output is correct
44 Correct 228 ms 9656 KB Output is correct
45 Correct 180 ms 15304 KB Output is correct
46 Correct 174 ms 15376 KB Output is correct
47 Correct 173 ms 16372 KB Output is correct
48 Correct 240 ms 16840 KB Output is correct
49 Correct 196 ms 16584 KB Output is correct
50 Correct 224 ms 15816 KB Output is correct
51 Correct 257 ms 16764 KB Output is correct
52 Correct 184 ms 16780 KB Output is correct
53 Correct 187 ms 16744 KB Output is correct
54 Correct 189 ms 16592 KB Output is correct