답안 #837579

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
837579	2023-08-25T12:26:02 Z	Liudas	Rope (JOI17_rope)	C++17	80 / 100	2500 ms	170052 KB

rope

#include <bits/stdc++.h>
using namespace std;
int tree[1048576 * 2] = {0};
int N = 1048576;
void update(int head, int l, int r, int pos, int val){
	if(r - l == 1){
		tree[head] += val;
		return;
	}
	int mid = (l + r) / 2;
	if(pos < mid){
		update(head * 2 + 1, l, mid, pos, val);
	}
	else{
		update(head *2 + 2, mid, r, pos, val);
	}
	tree[head] = max(tree[head * 2 + 2], tree[head * 2 + 1]); 
}
void update(int pos, int val){
	update(0, 0, N, pos, val);
}
int arr[1000050];
int main(){
	int N, M;
	cin >> N >> M;
	for(int i = 0; i < N; i ++){
		cin >> arr[i];
		arr[i]--;
	}
	vector<vector<vector<int>>> brr(M + 5, vector<vector<int>>(2));
	vector<int> counts(M + 5);
	for(int i = 0; i < N; i ++){
		for(int j = 0; j < 2; j ++){
			int pi = i + 1 - (i + j) % 2 * 2;
			if(pi > -1 && pi < N && arr[pi] != arr[i]){
				brr[arr[i]][j].push_back(arr[pi]);
			}
		}
		counts[arr[i]] ++;
		update(arr[i], 1);
	}
	for(int i = 0; i < M; i ++){
		update(i, -counts[i]);
		int ans = N;
		for(int j = 0; j < 2; j ++){
			for(int &k : brr[i][j])update(k, -1);
			ans = min(ans, N-tree[0]-counts[i]);
			for(int &k : brr[i][j])update(k, 1);
		}
		update(i, counts[i]);
		cout << ans << endl;
	}
}

Subtask #1
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	0 ms	340 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	0 ms	340 KB	Output is correct
25	Correct	0 ms	340 KB	Output is correct
26	Correct	0 ms	340 KB	Output is correct

Subtask #2
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	0 ms	340 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	0 ms	340 KB	Output is correct
25	Correct	0 ms	340 KB	Output is correct
26	Correct	0 ms	340 KB	Output is correct
27	Correct	62 ms	1876 KB	Output is correct
28	Correct	52 ms	1740 KB	Output is correct
29	Correct	60 ms	1884 KB	Output is correct
30	Correct	54 ms	1484 KB	Output is correct
31	Correct	60 ms	1860 KB	Output is correct
32	Correct	52 ms	1796 KB	Output is correct
33	Correct	62 ms	1748 KB	Output is correct
34	Correct	54 ms	1484 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	0 ms	340 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	0 ms	340 KB	Output is correct
25	Correct	0 ms	340 KB	Output is correct
26	Correct	0 ms	340 KB	Output is correct
27	Correct	62 ms	1876 KB	Output is correct
28	Correct	52 ms	1740 KB	Output is correct
29	Correct	60 ms	1884 KB	Output is correct
30	Correct	54 ms	1484 KB	Output is correct
31	Correct	60 ms	1860 KB	Output is correct
32	Correct	52 ms	1796 KB	Output is correct
33	Correct	62 ms	1748 KB	Output is correct
34	Correct	54 ms	1484 KB	Output is correct
35	Correct	79 ms	1876 KB	Output is correct
36	Correct	77 ms	1952 KB	Output is correct
37	Correct	76 ms	1836 KB	Output is correct
38	Correct	80 ms	1904 KB	Output is correct
39	Correct	76 ms	1916 KB	Output is correct
40	Correct	70 ms	2004 KB	Output is correct
41	Correct	76 ms	2124 KB	Output is correct
42	Correct	68 ms	1944 KB	Output is correct
43	Correct	67 ms	2132 KB	Output is correct
44	Correct	70 ms	2084 KB	Output is correct
45	Correct	70 ms	2000 KB	Output is correct
46	Correct	70 ms	1980 KB	Output is correct
47	Correct	68 ms	2044 KB	Output is correct

Subtask #4
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	0 ms	340 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	0 ms	340 KB	Output is correct
25	Correct	0 ms	340 KB	Output is correct
26	Correct	0 ms	340 KB	Output is correct
27	Correct	62 ms	1876 KB	Output is correct
28	Correct	52 ms	1740 KB	Output is correct
29	Correct	60 ms	1884 KB	Output is correct
30	Correct	54 ms	1484 KB	Output is correct
31	Correct	60 ms	1860 KB	Output is correct
32	Correct	52 ms	1796 KB	Output is correct
33	Correct	62 ms	1748 KB	Output is correct
34	Correct	54 ms	1484 KB	Output is correct
35	Correct	79 ms	1876 KB	Output is correct
36	Correct	77 ms	1952 KB	Output is correct
37	Correct	76 ms	1836 KB	Output is correct
38	Correct	80 ms	1904 KB	Output is correct
39	Correct	76 ms	1916 KB	Output is correct
40	Correct	70 ms	2004 KB	Output is correct
41	Correct	76 ms	2124 KB	Output is correct
42	Correct	68 ms	1944 KB	Output is correct
43	Correct	67 ms	2132 KB	Output is correct
44	Correct	70 ms	2084 KB	Output is correct
45	Correct	70 ms	2000 KB	Output is correct
46	Correct	70 ms	1980 KB	Output is correct
47	Correct	68 ms	2044 KB	Output is correct
48	Correct	922 ms	17796 KB	Output is correct
49	Correct	850 ms	17760 KB	Output is correct
50	Correct	862 ms	17788 KB	Output is correct
51	Correct	813 ms	17628 KB	Output is correct
52	Correct	786 ms	15468 KB	Output is correct
53	Correct	818 ms	16312 KB	Output is correct
54	Correct	782 ms	14192 KB	Output is correct
55	Correct	780 ms	13756 KB	Output is correct
56	Correct	775 ms	13260 KB	Output is correct

Subtask #5
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	0 ms	340 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	0 ms	340 KB	Output is correct
25	Correct	0 ms	340 KB	Output is correct
26	Correct	0 ms	340 KB	Output is correct
27	Correct	62 ms	1876 KB	Output is correct
28	Correct	52 ms	1740 KB	Output is correct
29	Correct	60 ms	1884 KB	Output is correct
30	Correct	54 ms	1484 KB	Output is correct
31	Correct	60 ms	1860 KB	Output is correct
32	Correct	52 ms	1796 KB	Output is correct
33	Correct	62 ms	1748 KB	Output is correct
34	Correct	54 ms	1484 KB	Output is correct
35	Correct	79 ms	1876 KB	Output is correct
36	Correct	77 ms	1952 KB	Output is correct
37	Correct	76 ms	1836 KB	Output is correct
38	Correct	80 ms	1904 KB	Output is correct
39	Correct	76 ms	1916 KB	Output is correct
40	Correct	70 ms	2004 KB	Output is correct
41	Correct	76 ms	2124 KB	Output is correct
42	Correct	68 ms	1944 KB	Output is correct
43	Correct	67 ms	2132 KB	Output is correct
44	Correct	70 ms	2084 KB	Output is correct
45	Correct	70 ms	2000 KB	Output is correct
46	Correct	70 ms	1980 KB	Output is correct
47	Correct	68 ms	2044 KB	Output is correct
48	Correct	922 ms	17796 KB	Output is correct
49	Correct	850 ms	17760 KB	Output is correct
50	Correct	862 ms	17788 KB	Output is correct
51	Correct	813 ms	17628 KB	Output is correct
52	Correct	786 ms	15468 KB	Output is correct
53	Correct	818 ms	16312 KB	Output is correct
54	Correct	782 ms	14192 KB	Output is correct
55	Correct	780 ms	13756 KB	Output is correct
56	Correct	775 ms	13260 KB	Output is correct
57	Execution timed out	2553 ms	170052 KB	Time limit exceeded
58	Halted	0 ms	0 KB	-

답안 #837579

Compilation message

Subtask #1 15.0 / 15.0

Subtask #2 30.0 / 30.0

Subtask #3 10.0 / 10.0

Subtask #4 25.0 / 25.0

Subtask #5 0 / 20.0

Subtask #1
15.0 / 15.0

Subtask #2
30.0 / 30.0

Subtask #3
10.0 / 10.0

Subtask #4
25.0 / 25.0

Subtask #5
0 / 20.0