Submission #991513

# Submission time Handle Problem Language Result Execution time Memory
991513 2024-06-02T10:55:47 Z Muaath_5 September (APIO24_september) C++17
100 / 100
588 ms 16092 KB
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
using namespace std;

const int N = 1e5+1;

int tree[4*N];

void update(int idx, int l = 0, int r = N-1, int node=1) {
	if (l == r) {
		tree[node] = 1;
		return;
	}
	
	const int mid = (l+r)/2;
	if (idx <= mid)
		update(idx, l, mid, node*2);
	else
		update(idx, mid+1, r, node*2+1);
	
	tree[node] = tree[node*2] + tree[node*2+1];
}
int range_sum(int ql, int qr, int l = 0, int r = N-1, int node=1) {
	if (ql <= l && r <= qr) return tree[node];
	if (l > qr || r < ql) return 0;
	const int mid = (l+r)/2;
	return range_sum(ql, qr, l, mid, node*2) + range_sum(ql, qr, mid+1, r, node*2+1);
}

vector<int> adj[N];
int ttm, dt[N], ft[N];

void dfs(int node) {
	dt[node] = ttm++;
	for (int ch : adj[node]) {
		dfs(ch);
	}
	ft[node] = ttm-1;
}

int ismad(int node) {
	return range_sum(dt[node], ft[node]) < ft[node] - dt[node] + 1;
}

int solve(int n, int m, std::vector<int> P, std::vector<std::vector<int>> S) {
	memset(tree, 0, sizeof tree);
	ttm = 0;
	for (int i = 0; i < n; i++) {
		adj[i].clear();
	}	
	for (int i = 1; i < n; i++) {
		adj[P[i]].push_back(i);
	}
	dfs(0);
	int days = 0;
	int idx = 0;
	int madcnt = 0;
	while (idx < n-1) {
		do {
			for (int i = 0; i < m; i++) {
				// append S[i][idx] if not appended
				if (range_sum(dt[S[i][idx]], dt[S[i][idx]]) == 0) {
					update(dt[S[i][idx]]);
					int node = S[i][idx];
					if (ismad(node)) {
						madcnt++;
					} else {
						while (node != 0 && !ismad(P[node])) {
							madcnt--;
							node = P[node];
						}	
					}
				}
				
			}
			idx++;
			
		}
		while (idx < n-1 && (range_sum(0, n) != idx || madcnt));
		days++;
	}
	return days;
}

#ifdef MUAATH_5
int main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cout << solve(3, 1, {-1, 0, 0}, {{1, 2}}) << '\n';
	cout << solve(5, 2, {-1, 0, 0, 1, 1}, {{1, 2, 3, 4}, {4, 1, 2, 3}}) << '\n';
	cout << solve(7, 1, {-1, 0, 0, 1, 1, 3, 3}, {{3, 1, 4, 6, 2}}) << '\n';
}
#endif
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 4956 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 4956 KB Output is correct
2 Correct 4 ms 5064 KB Output is correct
3 Correct 4 ms 4956 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 4 ms 4956 KB Output is correct
9 Correct 4 ms 5064 KB Output is correct
10 Correct 4 ms 4956 KB Output is correct
11 Correct 4 ms 4952 KB Output is correct
12 Correct 4 ms 4956 KB Output is correct
13 Correct 4 ms 5040 KB Output is correct
14 Correct 4 ms 5044 KB Output is correct
15 Correct 4 ms 4956 KB Output is correct
16 Correct 4 ms 4956 KB Output is correct
17 Correct 4 ms 4956 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 4956 KB Output is correct
2 Correct 4 ms 5064 KB Output is correct
3 Correct 4 ms 4956 KB Output is correct
4 Correct 5 ms 4952 KB Output is correct
5 Correct 5 ms 5100 KB Output is correct
6 Correct 5 ms 5100 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 4956 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 4 ms 4956 KB Output is correct
16 Correct 4 ms 5064 KB Output is correct
17 Correct 4 ms 4956 KB Output is correct
18 Correct 4 ms 4952 KB Output is correct
19 Correct 4 ms 4956 KB Output is correct
20 Correct 4 ms 5040 KB Output is correct
21 Correct 4 ms 5044 KB Output is correct
22 Correct 4 ms 4956 KB Output is correct
23 Correct 4 ms 4956 KB Output is correct
24 Correct 4 ms 4956 KB Output is correct
25 Correct 5 ms 4952 KB Output is correct
26 Correct 5 ms 5100 KB Output is correct
27 Correct 5 ms 5100 KB Output is correct
28 Correct 5 ms 4956 KB Output is correct
29 Correct 5 ms 4956 KB Output is correct
30 Correct 5 ms 5044 KB Output is correct
31 Correct 5 ms 4952 KB Output is correct
32 Correct 5 ms 4952 KB Output is correct
33 Correct 6 ms 4956 KB Output is correct
34 Correct 5 ms 4952 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 4956 KB Output is correct
2 Correct 4 ms 5064 KB Output is correct
3 Correct 4 ms 4956 KB Output is correct
4 Correct 507 ms 12876 KB Output is correct
5 Correct 528 ms 12876 KB Output is correct
6 Correct 517 ms 12952 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 4 ms 4956 KB Output is correct
9 Correct 4 ms 5064 KB Output is correct
10 Correct 4 ms 4956 KB Output is correct
11 Correct 4 ms 4952 KB Output is correct
12 Correct 4 ms 4956 KB Output is correct
13 Correct 4 ms 5040 KB Output is correct
14 Correct 4 ms 5044 KB Output is correct
15 Correct 4 ms 4956 KB Output is correct
16 Correct 4 ms 4956 KB Output is correct
17 Correct 4 ms 4956 KB Output is correct
18 Correct 507 ms 12876 KB Output is correct
19 Correct 528 ms 12876 KB Output is correct
20 Correct 517 ms 12952 KB Output is correct
21 Correct 588 ms 9388 KB Output is correct
22 Correct 571 ms 9384 KB Output is correct
23 Correct 577 ms 9940 KB Output is correct
24 Correct 571 ms 9928 KB Output is correct
25 Correct 574 ms 9432 KB Output is correct
26 Correct 580 ms 9388 KB Output is correct
27 Correct 563 ms 10152 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 4956 KB Output is correct
2 Correct 4 ms 5064 KB Output is correct
3 Correct 4 ms 4956 KB Output is correct
4 Correct 5 ms 4952 KB Output is correct
5 Correct 5 ms 5100 KB Output is correct
6 Correct 5 ms 5100 KB Output is correct
7 Correct 507 ms 12876 KB Output is correct
8 Correct 528 ms 12876 KB Output is correct
9 Correct 517 ms 12952 KB Output is correct
10 Correct 200 ms 16044 KB Output is correct
11 Correct 184 ms 16072 KB Output is correct
12 Correct 185 ms 16092 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 4956 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 4 ms 4956 KB Output is correct
16 Correct 4 ms 5064 KB Output is correct
17 Correct 4 ms 4956 KB Output is correct
18 Correct 4 ms 4952 KB Output is correct
19 Correct 4 ms 4956 KB Output is correct
20 Correct 4 ms 5040 KB Output is correct
21 Correct 4 ms 5044 KB Output is correct
22 Correct 4 ms 4956 KB Output is correct
23 Correct 4 ms 4956 KB Output is correct
24 Correct 4 ms 4956 KB Output is correct
25 Correct 5 ms 4952 KB Output is correct
26 Correct 5 ms 5100 KB Output is correct
27 Correct 5 ms 5100 KB Output is correct
28 Correct 5 ms 4956 KB Output is correct
29 Correct 5 ms 4956 KB Output is correct
30 Correct 5 ms 5044 KB Output is correct
31 Correct 5 ms 4952 KB Output is correct
32 Correct 5 ms 4952 KB Output is correct
33 Correct 6 ms 4956 KB Output is correct
34 Correct 5 ms 4952 KB Output is correct
35 Correct 507 ms 12876 KB Output is correct
36 Correct 528 ms 12876 KB Output is correct
37 Correct 517 ms 12952 KB Output is correct
38 Correct 588 ms 9388 KB Output is correct
39 Correct 571 ms 9384 KB Output is correct
40 Correct 577 ms 9940 KB Output is correct
41 Correct 571 ms 9928 KB Output is correct
42 Correct 574 ms 9432 KB Output is correct
43 Correct 580 ms 9388 KB Output is correct
44 Correct 563 ms 10152 KB Output is correct
45 Correct 200 ms 16044 KB Output is correct
46 Correct 184 ms 16072 KB Output is correct
47 Correct 185 ms 16092 KB Output is correct
48 Correct 214 ms 11464 KB Output is correct
49 Correct 207 ms 11324 KB Output is correct
50 Correct 210 ms 12016 KB Output is correct
51 Correct 218 ms 12136 KB Output is correct
52 Correct 208 ms 11284 KB Output is correct
53 Correct 208 ms 11292 KB Output is correct
54 Correct 213 ms 12128 KB Output is correct