oj.uz

답안 #925453

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
925453 2024-02-11T16:29:32 Z Xiaoyang JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 26 ms 5676 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
 
#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 1ll<<60
#define rep(i,a,b) for (ll i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
#define endl "\n"
void inc(ll &a,ll b) {a=(a+b)%mod;}
void dec(ll &a,ll b) {a=(a-b+mod)%mod;}
int prod(ll a,ll b) {return ll(a)*ll(b)%mod;}
int lowbit(ll x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}
 
const ll maxn=222222;
ll f[3][maxn];

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	ll n,k;cin>>n>>k;
	string s;cin>>s;
	s='0'+s;
	rep(i,1,n+1){
		f[0][i]=f[0][i-1];
		f[1][i]=f[1][i-1];
		f[2][i]=f[2][i-1];
		if(s[i]=='J')f[0][i]++;
		if(s[i]=='O')f[1][i]++;
		if(s[i]=='I')f[2][i]++;
	}
	ll ans=inf;
	
	rep(i,1,n+1){
		ll a=lower_bound(f[0]+i,f[0]+n+1,f[0][i-1]+k)-f[0];
		if(a>n)break;
		ll b=lower_bound(f[1]+a,f[1]+n+1,f[1][a-1]+k)-f[1];
		if(b>n)break;
		ll c=lower_bound(f[2]+b,f[2]+n+1,f[2][b-1]+k)-f[2];
		if(c>n)break;
		ans=min(ans,c-i+1-3*k);
		//find shortest substring with k of j,o and i in order 
	}
	
	if(ans==inf)cout<<-1<<endl;
	else cout<<ans<<endl;
	return 0;
}
/*

*/

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 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 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 560 KB Output is correct
18 Correct 0 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 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 464 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 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 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 560 KB Output is correct
18 Correct 0 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 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 464 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 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 24 ms 5168 KB Output is correct
37 Correct 26 ms 5668 KB Output is correct
38 Correct 18 ms 5668 KB Output is correct
39 Correct 19 ms 5412 KB Output is correct
40 Correct 7 ms 5668 KB Output is correct
41 Correct 15 ms 5668 KB Output is correct
42 Correct 23 ms 5668 KB Output is correct
43 Correct 3 ms 3808 KB Output is correct
44 Correct 3 ms 4432 KB Output is correct
45 Correct 4 ms 5668 KB Output is correct
46 Correct 4 ms 5676 KB Output is correct
47 Correct 4 ms 5668 KB Output is correct
48 Correct 5 ms 5664 KB Output is correct
49 Correct 4 ms 3644 KB Output is correct
50 Correct 4 ms 5528 KB Output is correct
51 Correct 4 ms 5556 KB Output is correct
52 Correct 4 ms 5416 KB Output is correct
53 Correct 4 ms 5436 KB Output is correct
54 Correct 11 ms 5664 KB Output is correct
55 Correct 5 ms 5664 KB Output is correct
56 Correct 4 ms 5440 KB Output is correct