Submission #203844

# Submission time Handle Problem Language Result Execution time Memory
203844 2020-02-22T14:26:15 Z Evirir JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
17 ms 3188 KB
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=a;i<b;i++)
#define fore(i,a,b) for(int i=a;i<=b;i++)
#define pb push_back
#define F first
#define S second
#define INF ll(1e18)
#define MOD 998244353
#define pqueue priority_queue
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;

#define MAXN 100005

int conv(char c){
	if(c=='J') return 0;
	if(c=='O') return 1;
	return 2;
}

int n,k;
string s;
vi loc[3];
ll ans=INF;

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	
	cin>>n>>k;
	cin>>s;
	
	forn(i,0,n){
		loc[conv(s[i])].pb(i);
	}
	
	for(auto p0=loc[0].begin();p0!=loc[0].end();p0++)
	{
		int d1=*p0;
		auto p1=p0+k-1;
		if(p1>=loc[0].end()) break;
		
		auto p2=upper_bound(loc[1].begin(),loc[1].end(),*p1);
		if(p2>=loc[1].end()) break;
		p2+=k-1;
		if(p2>=loc[1].end()) break;
		
		auto p3=upper_bound(loc[2].begin(),loc[2].end(),*p2);
		if(p3>=loc[2].end()) break;
		p3+=k-1;
		if(p3>=loc[2].end()) break;
		
		ans=min(ans, *p3-d1+1-3*k);
	}
	
	if(ans==INF) cout<<-1<<'\n';
	else cout<<ans<<'\n';
	
	return 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 6 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 380 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 248 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
# 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 6 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 380 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 248 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 380 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 380 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 6 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 380 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
# 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 6 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 380 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 248 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 380 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 380 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 6 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 380 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 15 ms 2168 KB Output is correct
37 Correct 17 ms 2740 KB Output is correct
38 Correct 17 ms 2736 KB Output is correct
39 Correct 15 ms 2676 KB Output is correct
40 Correct 12 ms 2672 KB Output is correct
41 Correct 14 ms 2920 KB Output is correct
42 Correct 16 ms 2740 KB Output is correct
43 Correct 8 ms 1812 KB Output is correct
44 Correct 9 ms 2000 KB Output is correct
45 Correct 10 ms 2928 KB Output is correct
46 Correct 9 ms 2740 KB Output is correct
47 Correct 10 ms 2672 KB Output is correct
48 Correct 12 ms 2744 KB Output is correct
49 Correct 8 ms 1784 KB Output is correct
50 Correct 10 ms 2736 KB Output is correct
51 Correct 10 ms 2924 KB Output is correct
52 Correct 9 ms 2228 KB Output is correct
53 Correct 10 ms 2796 KB Output is correct
54 Correct 12 ms 3184 KB Output is correct
55 Correct 10 ms 3064 KB Output is correct
56 Correct 9 ms 3188 KB Output is correct