제출 #482910

#제출 시각아이디문제언어결과실행 시간메모리
482910cristi_aJJOOII 2 (JOI20_ho_t2)C++17
100 / 100
10 ms3152 KiB
#include <bits/stdc++.h> using namespace std; const int nmax = 2e5 + 5; int sj[nmax],so[nmax],si[nmax]; int main () { int n,k; cin >> n >> k; string t; cin >> t; t = "X" + t; for(int i=1; i<=n; i++) { sj[i] = sj[i-1] + (t[i]=='J'); so[i] = so[i-1] + (t[i]=='O'); si[i] = si[i-1] + (t[i]=='I'); } int j = 0; int o = 0; int i = 0; int mn = 1e9; for(int l=0; l<n; l++) { while(j<=n and sj[j]-sj[l]<k) j++; while(o<=n and so[o]-so[j]<k) o++; while(i<=n and si[i]-si[o]<k) i++; if(j<=n and o<=n and i<=n and i-l<mn) mn = i - l; } mn = mn - 3*k; if(mn>n) mn = -1; cout << mn; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...