Submission #759746

#	Time	Username	Problem	Language	Result	Execution time	Memory
759746		bachhoangxuan	JJOOII 2 (JOI20_ho_t2)	C++17	100 / 100	12 ms	5748 KiB

ho_t2

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define fi first
#define se second
const int inf=1e18;
const int mod=1e9+7;
const int maxn=2005;
const int bl=650;
const int maxs=650;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

void solve(){
    int n,k,ans=inf;cin >> n >> k;
    vector<int> J(n,0),O(n,0),I(n,0);
    deque<int> dq;
    for(int i=0;i<n;i++){
        char c;cin >> c;
        if(c=='J') J[i]=1;
        else if(c=='O') O[i]=1;
        else I[i]=1;
    }
    for(int i=0;i<n;i++){
        if(J[i]) dq.push_back(i);
        if((int)dq.size()>k) dq.pop_front();
        J[i]=((int)dq.size()==k?dq.front():-1);
    }
    dq.clear();
    for(int i=0;i<n;i++){
        if(O[i]) dq.push_back(i);
        if((int)dq.size()>k) dq.pop_front();
        O[i]=((int)dq.size()==k?J[dq.front()]:-1);
    }
    dq.clear();
    for(int i=0;i<n;i++){
        if(I[i]) dq.push_back(i);
        if((int)dq.size()>k) dq.pop_front();
        I[i]=((int)dq.size()==k?O[dq.front()]:-1);
        if(I[i]!=-1) ans=min(ans,i-I[i]+1-3*k);
    }
    cout << (ans==inf?-1:ans) << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

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