Submission #702096

#	Time	Username	Problem	Language	Result	Execution time	Memory
702096		vjudge1	JJOOII 2 (JOI20_ho_t2)	C++17	100 / 100	12 ms	3032 KiB

ho_t2

#include "bits/stdc++.h"
#pragma optimize ("Bismillahirrahmanirrahim")
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n" 
#define MOD 1000000007
#define int long long
#define double long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define what_is(x) cerr << #x << " is " << x << endl;
//#define m (l+r)/2
constexpr int N=200005;
constexpr int  INF2 = LLONG_MAX;
constexpr int INF=(int)1e18;
constexpr int LOG=30;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
typedef priority_queue<pii> max_pq;
typedef long long ll;
//to think//
/*
 * graph approach
 * dp
 * dividing the problem to smaller statements
 * finding the real constraint
 * sqrt decomposition
 * greedy approach
 * pigeonhole principle
 * rewriting the problem/equality 
 * bitwise approaches
 * binary search if monotonic
 * divide and conquer
 * combinatorics
 * inclusion - exclusion
 * think like bfs
*/

template<typename T>
inline T in()
{
  T x;
  cin >> x;
  return x;
}


void solve()
{
  int n=in<int>(),k=in<int>();
  string s=in<string>();
   
  vector<int> v[3];

  for(int i=0;i<n;i++)
  {
    if(s[i]=='J') v[0].pb(i);
    else if(s[i]=='O') v[1].pb(i);
    else v[2].pb(i);
  }

  int ans=n+2;
  int kac=0;
  for(int i=0;i<n;i++)
  {
    if(s[i]=='J')
    {
      int x=v[0][kac];
      if(kac+k-1>=sz(v[0])) break;
      int y=v[0][kac+k-1];
      int it=upper_bound(all(v[1]),y)-v[1].begin();
      if(it+k-1>=sz(v[1])) break;
      pii os={v[1][it],v[1][it+k-1]};
      int it2=upper_bound(all(v[2]),os.ss)-v[2].begin();
      if(it2+k-1>=sz(v[2])) break;
      pii is={v[2][it2],v[2][it2+k-1]};

      int cur=is.ss-x+1-3*k;
      ans=min(ans,cur);
    }

    if(s[i]=='J') kac++;
  }

  cout << (ans==n+2 ? -1 : ans) << endl;
}

int32_t main(){
   

     cin.tie(0); ios::sync_with_stdio(0);
     cout << fixed <<  setprecision(15);
   
   int t=1;//t=in();
 
 for(int i=1;i<=t;i++)
 {
  //  cout << "Case #" << i << ": ";
    solve();
 }
 
 return 0;
}

Compilation message (stderr)

ho_t2.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize ("Bismillahirrahmanirrahim")
      |

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