oj.uz

Submission #991200

# Submission time Handle Problem Language Result Execution time Memory
991200 2024-06-01T14:50:54 Z model_code September (APIO24_september) C++17
100 / 100
 113 ms 15308 KB 
#include"september.h"
#define MaxN 100500
int son[MaxN];
bool vis[MaxN];
std::vector<int> g[MaxN];
void calc(int N, std::vector<int>& S, bool *flag, int *tmin, int *tmax)
{
	for (int i = 0; i < N; i++)
		vis[i] = 0;
	int cnt = 0;
	for (int i = 0; i < N-1; i++) {
		int u = S[i];
		tmin[u] = std::min(tmin[u], i);
		tmax[u] = std::max(tmax[u], i);
		vis[u] = 1;
		cnt += son[u];
		for (int j = 0; j < g[u].size(); j++)
			if (vis[g[u][j]])
				cnt--;
		flag[i] &= (cnt==0);
	}
}
int tmin[MaxN], tmax[MaxN], o[MaxN];
bool flag[MaxN];
int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
	for (int i = 0; i < N; i++) {
		g[i].clear();
	 	son[i] = 0;
    }
	for (int i = 1; i < N; i++) {
		g[F[i]].push_back(i);
		g[i].push_back(F[i]);
		son[F[i]]++;
	}
	for (int i = 0; i+1 < N-1; i++) {
		flag[i] = 1;
		o[i] = 0;
	}
	for (int i = 1; i < N; i++) {
		tmin[i] = N+1;
		tmax[i] = -1;
	}
	for (int i = 0; i < M; i++)
		calc(N, S[i], flag, tmin, tmax);
	for (int id = 1; id < N; id++) {
		o[tmin[id]]++;
		o[tmax[id]]--;
	}
	int ans = 1;
	for (int i = 0; i+1 < N-1; i++) {
		if (i>0)
			o[i] += o[i-1];
		if (!o[i] && flag[i])
			ans++;
	}
	return ans;
}

Compilation message

september.cpp: In function 'void calc(int, std::vector<int>&, bool*, int*, int*)':
september.cpp:17:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |   for (int j = 0; j < g[u].size(); j++)
      |                   ~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3928 KB Output is correct
2 Correct 1 ms 3924 KB Output is correct
3 Correct 2 ms 3932 KB Output is correct
4 Correct 1 ms 3932 KB Output is correct
5 Correct 1 ms 3932 KB Output is correct
6 Correct 1 ms 3932 KB Output is correct
7 Correct 1 ms 3932 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3928 KB Output is correct
2 Correct 1 ms 3924 KB Output is correct
3 Correct 2 ms 3932 KB Output is correct
4 Correct 1 ms 3932 KB Output is correct
5 Correct 1 ms 3932 KB Output is correct
6 Correct 1 ms 3932 KB Output is correct
7 Correct 1 ms 3932 KB Output is correct
8 Correct 2 ms 3932 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 1 ms 4188 KB Output is correct
11 Correct 1 ms 3932 KB Output is correct
12 Correct 1 ms 3932 KB Output is correct
13 Correct 1 ms 3932 KB Output is correct
14 Correct 1 ms 3932 KB Output is correct

Subtask #3
5.0 / 5.0

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

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3928 KB Output is correct
2 Correct 1 ms 3924 KB Output is correct
3 Correct 2 ms 3932 KB Output is correct
4 Correct 1 ms 3932 KB Output is correct
5 Correct 1 ms 3932 KB Output is correct
6 Correct 1 ms 3932 KB Output is correct
7 Correct 1 ms 3932 KB Output is correct
8 Correct 2 ms 3932 KB Output is correct
9 Correct 1 ms 3932 KB Output is correct
10 Correct 1 ms 3932 KB Output is correct
11 Correct 1 ms 3932 KB Output is correct
12 Correct 2 ms 4184 KB Output is correct
13 Correct 2 ms 3932 KB Output is correct
14 Correct 2 ms 3932 KB Output is correct
15 Correct 1 ms 3932 KB Output is correct
16 Correct 1 ms 3936 KB Output is correct
17 Correct 2 ms 3940 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3932 KB Output is correct
2 Correct 1 ms 3932 KB Output is correct
3 Correct 1 ms 3932 KB Output is correct
4 Correct 3 ms 3928 KB Output is correct
5 Correct 2 ms 3932 KB Output is correct
6 Correct 2 ms 3932 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3928 KB Output is correct
2 Correct 1 ms 3924 KB Output is correct
3 Correct 2 ms 3932 KB Output is correct
4 Correct 1 ms 3932 KB Output is correct
5 Correct 1 ms 3932 KB Output is correct
6 Correct 1 ms 3932 KB Output is correct
7 Correct 1 ms 3932 KB Output is correct
8 Correct 2 ms 3932 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 1 ms 4188 KB Output is correct
11 Correct 1 ms 3932 KB Output is correct
12 Correct 1 ms 3932 KB Output is correct
13 Correct 1 ms 3932 KB Output is correct
14 Correct 1 ms 3932 KB Output is correct
15 Correct 2 ms 3932 KB Output is correct
16 Correct 1 ms 3932 KB Output is correct
17 Correct 1 ms 3932 KB Output is correct
18 Correct 1 ms 3932 KB Output is correct
19 Correct 2 ms 4184 KB Output is correct
20 Correct 2 ms 3932 KB Output is correct
21 Correct 2 ms 3932 KB Output is correct
22 Correct 1 ms 3932 KB Output is correct
23 Correct 1 ms 3936 KB Output is correct
24 Correct 2 ms 3940 KB Output is correct
25 Correct 3 ms 3928 KB Output is correct
26 Correct 2 ms 3932 KB Output is correct
27 Correct 2 ms 3932 KB Output is correct
28 Correct 2 ms 3940 KB Output is correct
29 Correct 2 ms 3932 KB Output is correct
30 Correct 2 ms 2908 KB Output is correct
31 Correct 2 ms 2908 KB Output is correct
32 Correct 2 ms 2908 KB Output is correct
33 Correct 2 ms 2908 KB Output is correct
34 Correct 2 ms 2908 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3932 KB Output is correct
2 Correct 1 ms 3932 KB Output is correct
3 Correct 1 ms 3932 KB Output is correct
4 Correct 88 ms 9260 KB Output is correct
5 Correct 113 ms 9260 KB Output is correct
6 Correct 84 ms 9268 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3928 KB Output is correct
2 Correct 1 ms 3924 KB Output is correct
3 Correct 2 ms 3932 KB Output is correct
4 Correct 1 ms 3932 KB Output is correct
5 Correct 1 ms 3932 KB Output is correct
6 Correct 1 ms 3932 KB Output is correct
7 Correct 1 ms 3932 KB Output is correct
8 Correct 2 ms 3932 KB Output is correct
9 Correct 1 ms 3932 KB Output is correct
10 Correct 1 ms 3932 KB Output is correct
11 Correct 1 ms 3932 KB Output is correct
12 Correct 2 ms 4184 KB Output is correct
13 Correct 2 ms 3932 KB Output is correct
14 Correct 2 ms 3932 KB Output is correct
15 Correct 1 ms 3932 KB Output is correct
16 Correct 1 ms 3936 KB Output is correct
17 Correct 2 ms 3940 KB Output is correct
18 Correct 88 ms 9260 KB Output is correct
19 Correct 113 ms 9260 KB Output is correct
20 Correct 84 ms 9268 KB Output is correct
21 Correct 105 ms 9892 KB Output is correct
22 Correct 113 ms 9908 KB Output is correct
23 Correct 105 ms 9392 KB Output is correct
24 Correct 98 ms 9404 KB Output is correct
25 Correct 104 ms 9904 KB Output is correct
26 Correct 105 ms 9776 KB Output is correct
27 Correct 97 ms 9388 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3932 KB Output is correct
2 Correct 1 ms 3932 KB Output is correct
3 Correct 1 ms 3932 KB Output is correct
4 Correct 3 ms 3928 KB Output is correct
5 Correct 2 ms 3932 KB Output is correct
6 Correct 2 ms 3932 KB Output is correct
7 Correct 88 ms 9260 KB Output is correct
8 Correct 113 ms 9260 KB Output is correct
9 Correct 84 ms 9268 KB Output is correct
10 Correct 54 ms 12352 KB Output is correct
11 Correct 56 ms 12248 KB Output is correct
12 Correct 55 ms 12232 KB Output is correct

Subtask #10
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3928 KB Output is correct
2 Correct 1 ms 3924 KB Output is correct
3 Correct 2 ms 3932 KB Output is correct
4 Correct 1 ms 3932 KB Output is correct
5 Correct 1 ms 3932 KB Output is correct
6 Correct 1 ms 3932 KB Output is correct
7 Correct 1 ms 3932 KB Output is correct
8 Correct 2 ms 3932 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 1 ms 4188 KB Output is correct
11 Correct 1 ms 3932 KB Output is correct
12 Correct 1 ms 3932 KB Output is correct
13 Correct 1 ms 3932 KB Output is correct
14 Correct 1 ms 3932 KB Output is correct
15 Correct 2 ms 3932 KB Output is correct
16 Correct 1 ms 3932 KB Output is correct
17 Correct 1 ms 3932 KB Output is correct
18 Correct 1 ms 3932 KB Output is correct
19 Correct 2 ms 4184 KB Output is correct
20 Correct 2 ms 3932 KB Output is correct
21 Correct 2 ms 3932 KB Output is correct
22 Correct 1 ms 3932 KB Output is correct
23 Correct 1 ms 3936 KB Output is correct
24 Correct 2 ms 3940 KB Output is correct
25 Correct 3 ms 3928 KB Output is correct
26 Correct 2 ms 3932 KB Output is correct
27 Correct 2 ms 3932 KB Output is correct
28 Correct 2 ms 3940 KB Output is correct
29 Correct 2 ms 3932 KB Output is correct
30 Correct 2 ms 2908 KB Output is correct
31 Correct 2 ms 2908 KB Output is correct
32 Correct 2 ms 2908 KB Output is correct
33 Correct 2 ms 2908 KB Output is correct
34 Correct 2 ms 2908 KB Output is correct
35 Correct 88 ms 9260 KB Output is correct
36 Correct 113 ms 9260 KB Output is correct
37 Correct 84 ms 9268 KB Output is correct
38 Correct 105 ms 9892 KB Output is correct
39 Correct 113 ms 9908 KB Output is correct
40 Correct 105 ms 9392 KB Output is correct
41 Correct 98 ms 9404 KB Output is correct
42 Correct 104 ms 9904 KB Output is correct
43 Correct 105 ms 9776 KB Output is correct
44 Correct 97 ms 9388 KB Output is correct
45 Correct 54 ms 12352 KB Output is correct
46 Correct 56 ms 12248 KB Output is correct
47 Correct 55 ms 12232 KB Output is correct
48 Correct 87 ms 12372 KB Output is correct
49 Correct 67 ms 12488 KB Output is correct
50 Correct 81 ms 12340 KB Output is correct
51 Correct 63 ms 13264 KB Output is correct
52 Correct 73 ms 12752 KB Output is correct
53 Correct 67 ms 13296 KB Output is correct
54 Correct 65 ms 15308 KB Output is correct