oj.uz

Submission #202050

# Submission time Handle Problem Language Result Execution time Memory
202050 2020-02-13T09:24:45 Z khohko JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 22 ms 3848 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ARRS ((ll)(4e5+100))
#define fr first
#define sc second
#define pb push_back
#define MX ((ll)(1e9+100))
#define MAX ((ll)(1e18+100))

ll n;
pair<ll,ll> a[ARRS];
ll b[ARRS];
ll ans[ARRS];
ll pl[ARRS];
ll pr[ARRS];
int main(){
	ll n,m;
	string s;
	cin>>n>>m;
	cin>>s;
	ll l=0,r=0,c=0;
	for(r=0; r<n&&c!=m; r++){
		c+=s[r]=='J';
		pl[r]=MAX;
	}
	if(c<m){
		cout<<-1;
		return 0;
	}
	while(s[l]!='J')l++;
	for(;r<n;r++){
		pl[r]=r-l-m;
		if(s[r]=='J'){
			l++;
			while(s[l]!='J')l++;
		}
	}
	reverse(s.begin(),s.end());
	l=0,r=0,c=0;
	for(r=0; r<n&&c!=m; r++){
		c+=s[r]=='I';
		pr[n-r-1]=MAX;
	}
	if(c<m){
		cout<<-1;
		return 0;
	}
	while(s[l]!='I')l++;
	for(;r<n;r++){
		pr[n-r-1]=r-l-m;
		if(s[r]=='I'){
			l++;
			while(s[l]!='I')l++;
		}
	}
	reverse(s.begin(),s.end());
	l=0,r=0,c=0;
	for(r=0; r<n&&c!=m; r++){
		c+=s[r]=='O';
	}
	if(c<m){
		cout<<-1;
		return 0;
	}
	while(s[l]!='O')l++;
	ll mn=MAX;
	for(;r<n;r++){
		mn=min(mn, pl[l]+pr[r-1]+r-l-m);
		if(s[r]=='O'){
			l++;
			while(s[l]!='O')l++;
		}
	}
 
	if(mn==MAX)
		cout<<-1<<endl;
	else
		cout<<mn<<endl;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 248 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 248 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 380 KB Output is correct
29 Correct 6 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 248 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 380 KB Output is correct
29 Correct 6 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 19 ms 3596 KB Output is correct
37 Correct 20 ms 3848 KB Output is correct
38 Correct 20 ms 3720 KB Output is correct
39 Correct 22 ms 3720 KB Output is correct
40 Correct 21 ms 3844 KB Output is correct
41 Correct 22 ms 3848 KB Output is correct
42 Correct 21 ms 3720 KB Output is correct
43 Correct 14 ms 2568 KB Output is correct
44 Correct 16 ms 3080 KB Output is correct
45 Correct 20 ms 3848 KB Output is correct
46 Correct 20 ms 3720 KB Output is correct
47 Correct 20 ms 3848 KB Output is correct
48 Correct 21 ms 3716 KB Output is correct
49 Correct 15 ms 2696 KB Output is correct
50 Correct 20 ms 3720 KB Output is correct
51 Correct 20 ms 3724 KB Output is correct
52 Correct 17 ms 3592 KB Output is correct
53 Correct 18 ms 3772 KB Output is correct
54 Correct 17 ms 3720 KB Output is correct
55 Correct 17 ms 3848 KB Output is correct
56 Correct 17 ms 3848 KB Output is correct