Submission #733497

# Submission time Handle Problem Language Result Execution time Memory
733497 2023-05-01T00:30:21 Z pcc JJOOII 2 (JOI20_ho_t2) C++14
100 / 100
11 ms 3276 KB
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<ll,ll>
#define fs first
#define sc second

const int inf = 1e9;

void solve(){
	int n,k;
	cin>>n>>k;
	string s;
	cin>>s;
	deque<char> dq;
	for(auto &i:s)dq.push_back(i);
	while(!dq.empty()&&dq.front() != 'J')dq.pop_front();
	while(!dq.empty()&&dq.back() != 'I')dq.pop_back();
	n = dq.size();
	int ans = inf;
	int jp[n+1] = {},ip[n+1] = {},op[n+1] = {};
	int pref = 0;
	int p = 0;
	//for(auto &i:dq)cout<<i;cout<<endl;
	for(int i = 0;i<n;i++){
		if(p<=i){
			p = i+1;
			if(dq[i] == 'J')pref = 1;
			else pref = 0;
		}
		while(p<n&&pref<k){
			if(dq[p] == 'J')pref++;
			p++;
		}
		if(pref<k)jp[i] = -1;
		else jp[i] = p;
		if(dq[i] == 'J')pref--;
	}
	pref = 0;
	p = 0;
	for(int i = 0;i<n;i++){
		if(p<=i){
			p = i+1;
			if(dq[i] == 'O')pref = 1;
			else pref = 0;
		}
		while(p<n&&pref<k){
			if(dq[p] == 'O')pref++;
			p++;
		}
		if(pref<k)op[i] = -1;
		else op[i] = p;
		if(dq[i] == 'O')pref--;
	}
	pref = 0;
	p = 0;
	for(int i = 0;i<n;i++){
		if(p<=i){
			p = i+1;
			if(dq[i] == 'I')pref = 1;
			else pref = 0;
		}
		while(p<n&&pref<k){
			if(dq[p] == 'I')pref++;
			p++;
		}
		if(pref<k)ip[i] = -1;
		else ip[i] = p;
		if(dq[i] == 'I')pref--;
	}
	for(int i = 0;i<n;i++){
		int r = i;
		r = jp[r];
		if(r == -1)continue;
		r = op[r];
		if(r == -1)continue;
		r = ip[r];
		if(r == -1)continue;
		ans = min(ans,r-i-k*3);
	}
	cout<<(ans == inf?-1:ans)<<'\n';
}

int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int t=  1;
	while(t--)solve();
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 316 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 324 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 316 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 324 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 7 ms 3016 KB Output is correct
37 Correct 8 ms 3236 KB Output is correct
38 Correct 8 ms 3276 KB Output is correct
39 Correct 10 ms 3176 KB Output is correct
40 Correct 9 ms 3168 KB Output is correct
41 Correct 9 ms 3180 KB Output is correct
42 Correct 11 ms 3152 KB Output is correct
43 Correct 6 ms 2132 KB Output is correct
44 Correct 7 ms 2528 KB Output is correct
45 Correct 8 ms 3168 KB Output is correct
46 Correct 9 ms 3168 KB Output is correct
47 Correct 9 ms 3168 KB Output is correct
48 Correct 8 ms 3168 KB Output is correct
49 Correct 6 ms 2276 KB Output is correct
50 Correct 9 ms 3160 KB Output is correct
51 Correct 8 ms 3168 KB Output is correct
52 Correct 5 ms 3040 KB Output is correct
53 Correct 6 ms 3156 KB Output is correct
54 Correct 6 ms 3164 KB Output is correct
55 Correct 5 ms 3168 KB Output is correct
56 Correct 5 ms 3160 KB Output is correct