oj.uz

답안 #906425

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
906425 2024-01-14T09:04:26 Z vjudge1 JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 35 ms 8768 KB 
#include<bits/stdc++.h>
#include<queue>
#define ll long long
using namespace std;

ll n, k, dem = 0, cnt[5], pfs[(int)2e5+5][5];

char a[5] = {'J', 'O', 'I'};

string s;

ll bs(ll x, ll y, ll l, ll r){
	
	ll mid;
	
	while(l <= r){
		
		mid = (l+r)/2;
		
		if(pfs[mid][y] >= x + k) r = mid-1;
		
		else l = mid+1;
	}
	return l;
}

int main(){

	ios_base::sync_with_stdio(0);
	
	cin.tie(0);
	
	cin>>n>>k>>s;
	
	s = " "+s;
	
	for(int i = 1; i <= n; i++){
		
		for(int j = 0; j < 3; j++){
			
			if(s[i] == a[j]){
				
				pfs[i][j] = pfs[i-1][j] + 1;
			}
			
			else pfs[i][j] = pfs[i-1][j];
		}
	}
	
//	for(int i = 1; i <= n; i++) cout<<pfs[i][0]<<" ";
//	
//	cout<<endl;
	
	ll start = 1, i, j, ans = 0, x, ds = 1e18;
	
	bool flag = true;
	
	while(flag == true){
		
		i = start;
		
//		cout<<i<<endl;
		
		ans = 0; x = 0;
		
		for(int t = 0; t < 3; t++){
			
			i = bs((-1)*k+1, t, i, n);
			
			if(t == 0) x = i-1;
			
			j = bs(pfs[i-1][t], t, i, n);
			
//			cout<<i<<" "<<j<<" ";
			
			ans += i - x - 1 + j - i + 1 - k;
			
//			cout<<ans<<endl;
			
			if(i > n || j > n){
				
				flag = false;
				
				ans = 1e18;
				
//				cout<<"!! "<<i<<" "<<j;
				
				break;
			}
			
			i = j+1;
			
			x = j;
		}
//		cout<<ans<<endl<<endl;
		
		ds = min(ds, ans);
		
		if(flag == false) break;
		
//		if(start == 3) break;
		
		start++;
	}
	if(ds != 1e18) cout<<ds;
	
	else cout<<-1;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 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 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 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 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 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 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 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct

Subtask #3
87.0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 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 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 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 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 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 27 ms 7984 KB Output is correct
37 Correct 30 ms 8740 KB Output is correct
38 Correct 30 ms 8740 KB Output is correct
39 Correct 29 ms 8768 KB Output is correct
40 Correct 13 ms 8648 KB Output is correct
41 Correct 27 ms 8740 KB Output is correct
42 Correct 35 ms 8740 KB Output is correct
43 Correct 2 ms 7260 KB Output is correct
44 Correct 2 ms 7244 KB Output is correct
45 Correct 4 ms 8740 KB Output is correct
46 Correct 3 ms 8740 KB Output is correct
47 Correct 3 ms 8740 KB Output is correct
48 Correct 3 ms 8740 KB Output is correct
49 Correct 2 ms 7012 KB Output is correct
50 Correct 4 ms 8740 KB Output is correct
51 Correct 3 ms 8740 KB Output is correct
52 Correct 3 ms 8492 KB Output is correct
53 Correct 4 ms 8588 KB Output is correct
54 Correct 11 ms 8608 KB Output is correct
55 Correct 7 ms 8740 KB Output is correct
56 Correct 3 ms 8740 KB Output is correct