oj.uz

답안 #418059

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
418059 2021-06-05T01:36:59 Z FerThugGato12500 JJOOII 2 (JOI20_ho_t2) C++14
100 / 100
 10 ms 3304 KB 
#include<bits/stdc++.h>
#define forn(i, n) for(int i = 0; i < int(n); i++)
#define ll long long
const int lmt = 200005;
using namespace std;
int prefix[3][lmt];
int op(int i, int j, int type){
	return (i<=j ? prefix[type][j] - (i>0 ? prefix[type][i-1] : 0) : 0);
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int n, k; string s; cin>>n>>k>>s;
	int a[3]={0,0,0};
	forn(i, n){
		char x = s[i];
		if(x=='J'){
			prefix[0][i]++;
		}else if(x=='O'){
			prefix[1][i]++;
		}else{
			prefix[2][i]++;
		}
		if(i>0) {
			forn(j, 3){
				prefix[j][i] += prefix[j][i-1];
			}
		}
	}	
	int fin[3]={0,0,0};
	int d = n;
	for(int i = 0; i < n; i++){
		int last = i;
		forn(t, 3){
			while(fin[t]<n && op(last,fin[t], t)!=k){
				fin[t]++;
			}
			if(op(last, fin[t], t)!=k){
				cout<<(i>0 ? d : -1);
				return 0;
			}
			last = fin[t]+1;
		}
		d = min(d, (((fin[0] - i)+1) - k) + (((fin[1] - (fin[0]+1))+1) - k) + (((fin[2] - (fin[1]+1))+1) - k));
	}
	cout<<d;
	return 0;
}

Compilation message

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:14:6: warning: unused variable 'a' [-Wunused-variable]
   14 |  int a[3]={0,0,0};
      |      ^

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct

Subtask #3
87.0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 9 ms 2904 KB Output is correct
37 Correct 9 ms 3184 KB Output is correct
38 Correct 9 ms 3160 KB Output is correct
39 Correct 8 ms 3160 KB Output is correct
40 Correct 5 ms 3160 KB Output is correct
41 Correct 8 ms 3160 KB Output is correct
42 Correct 10 ms 3160 KB Output is correct
43 Correct 3 ms 2124 KB Output is correct
44 Correct 3 ms 2520 KB Output is correct
45 Correct 5 ms 3304 KB Output is correct
46 Correct 4 ms 3160 KB Output is correct
47 Correct 5 ms 3160 KB Output is correct
48 Correct 4 ms 3160 KB Output is correct
49 Correct 3 ms 2264 KB Output is correct
50 Correct 4 ms 3160 KB Output is correct
51 Correct 4 ms 3160 KB Output is correct
52 Correct 4 ms 3032 KB Output is correct
53 Correct 4 ms 3160 KB Output is correct
54 Correct 4 ms 3160 KB Output is correct
55 Correct 4 ms 3160 KB Output is correct
56 Correct 3 ms 3160 KB Output is correct