Submission #698054

#	Time	Username	Problem	Language	Result	Execution time	Memory
698054		myrcella	JJOOII 2 (JOI20_ho_t2)	C++17	100 / 100	10 ms	2904 KiB

ho_t2

//by szh
#include<bits/stdc++.h>
using namespace std;

#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 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int 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 int maxn = 2e5+10;

vector <int> pos[3];
int nxt[maxn];
int n,m;
string s;
int a[maxn];

int main() {
//	freopen("input.txt","r",stdin);	
	std::ios::sync_with_stdio(false);cin.tie(0);
	cin>>n>>m;
	cin>>s;
	rep(i,0,n) {
		int cur = 0;
		if (s[i]=='O') cur = 1;
		if (s[i]=='I') cur = 2;
		a[i] = cur;
		pos[cur].pb(i);
	}
	int ans = mod;
	rep(i,0,SZ(pos[0])-m+1) {
		int tmp = i+m-1;
		int tmpp = upper_bound(ALL(pos[1]),pos[0][tmp])-pos[1].begin();
		tmpp += m-1;
		if (tmpp>=SZ(pos[1])) continue;
		int tmppp = upper_bound(ALL(pos[2]),pos[1][tmpp])-pos[2].begin();
		tmppp += m-1;
		if (tmppp>=SZ(pos[2])) continue;
		ans = min(ans,pos[2][tmppp]-pos[0][i]+1);
	}
	if (ans==mod) cout<<-1;
	else cout<<ans-m*3;
	return 0;
}

• Subtask 1: 1 / 1
• Subtask 2: 12 / 12
• Subtask 3: 87 / 87