oj.uz

답안 #837543

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
837543 2023-08-25T12:07:55 Z Liudas Rope (JOI17_rope) C++17
0 / 100
 1 ms 724 KB 
#include <bits/stdc++.h>
using namespace std;
class segment_tree{
public:
int tree[50000] = {0};
int N = 50000;
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]--;
	}
	segment_tree tree;
	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]] ++;
		tree.update(arr[i], 1);
	}
	for(int i = 0; i < M; i ++){
		tree.update(i, -counts[i]);
		int ans = N;
		for(int j = 0; j < 2; j ++){
			for(int &k : brr[i][j])tree.update(k, -1);
			ans = min(ans, N-tree.tree[0]-counts[i]);
			for(int &k : brr[i][j])tree.update(k, 1);
		}
		tree.update(i, counts[i]);
		cout << ans << endl;
	}
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 724 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 724 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 724 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 724 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 724 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -