Submission #590352

#	Time	Username	Problem	Language	Result	Execution time	Memory
590352		ioi	JJOOII 2 (JOI20_ho_t2)	C++14	100 / 100	10 ms	5516 KiB

ho_t2

#include<bits/stdc++.h>

using namespace std;

#define debug(x) cout << '[' << #x << " is: " << x << "] " << endl;
#define inF freopen("cardgame.in" , "r" , stdin);
#define outF freopen("cardgame.out" , "w" , stdout);
#define imod(a , n) (a % n + n ) % n
#define sor(v) sort(v.begin() , v.end());
#define print(v) for(auto f : v ) cout << f << " " ;
#define rsor(v) sort(v.rbegin() , v.rend());
#define rev(v) reverse(v.begin() , v.end());
#define scan(v)for(auto &it : v)cin >> it ;
#define ll long long

#define logar(x , y) log(x) / log(y)
#define __sum(n) n * (n + 1) / 2
#define __lcm(a , b) a / __gcd(a , b) * b
#define pii pair<int , int >
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);

#define int ll

const int N =  3e5 + 5 ,  M = N * 4  , MX = 2e4 + 40;
const ll MOD = 998244353  , oo = 1e9 + 9 , OO = 1e18 , mod = MOD ;
const double pi = acos(-1) , eps = 1e-17 ;

int di[] = {1 , -1 , 0 , 0};
int dj[] = {0 , 0 , 1 , -1};



int32_t main()
{
    // inF;
   // inF;outF;
    fastio;

    //Welcome back without <TAWJIHI>


   int n , k;
   string s ;
   cin >> n >> k >> s ;
   deque<int> j ,o , i ;
   int oafterj[n] = {} , iaftero[n] = {};

   int mn = 1e9 ;

   for(int c = 0 ; c < n  ; c ++){
    if(s[c] == 'J')j.push_back(c);
    else if(s[c] == 'O')o.push_back(c) , oafterj[c] = 1;
    else i.push_back(c) , iaftero[c] = 1;
    if(c)oafterj[c] += oafterj[c - 1];
    if(c)iaftero[c] += iaftero[c - 1];


   }
   for(int c = 0 ; c < n && j.size() >= k ; c ++){
        int curr = j[k - 1];


        int counto = oafterj[n - 1];
        if(curr)counto -= oafterj[curr - 1];



        if(counto < k)break;
        int po = o[o.size() - 1 - counto + k];


        int counti = iaftero[n - 1];
        if(po)counti -= iaftero[po - 1];
        if(counti < k)break;

        int pi = i[i.size() - 1 - counti + k];


        int tmp = c ;
        tmp += (n - pi - 1);
        tmp += 3 * k ;
        mn = min(mn , n - tmp);
        if(s[c] == 'J')j.pop_front();
        else if(s[c] == 'I')i.pop_front();
        else o.pop_front();


   }


   cout << (mn == 1e9 ? -1 : mn);


}

Compilation message (stderr)

ho_t2.cpp: In function 'int32_t main()':
ho_t2.cpp:59:38: warning: comparison of integer expressions of different signedness: 'std::deque<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   59 |    for(int c = 0 ; c < n && j.size() >= k ; c ++){
      |                             ~~~~~~~~~^~~~

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