This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;// Hello world arsaoshe aneru nesi isods
const int mod = 1e9+7; const char nl = '\n'; typedef long long ll; const int N = 1e5 + 5 ;
#define ff first
#define ss second
void void_code () {
ll n; cin>> n; ll k;cin >> k;
string s; cin >> s ;
ll l = - 1 ;
ll r = n;
for ( int i =0 ; i < n; i++ ) {
if ( s [ i ] == 'J' ) {
l = i ;
break;
}
}
for ( int i = n - 1 ; i >= 0 ; i++ ) {
if ( s [ i ] == 'I' ) {
r = i ;
break;
}
}
ll res = 0 ;
ll cnt = 0 ;
ll ans = 1 ;
ll ch = 0 ;
vector < char > v = { 'J' , 'O' , 'I' };
for ( int i = l ; i <= r ; i ++ ) {
for ( int j = i + 1 ; j <= r ; j ++ ) {
if ( ans != k ) {
if ( s [ j ] == v [ ch ] ) {
ans ++ ;
}
else {
cnt ++ ;
}
}
if ( ans == k ) {
i = j ;
res = cnt ;
cnt = 0 ;
ans = 1;
ch ++ ;
j = r ;
}
}
}
cout << res ;
}
signed main() {
ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
int t = 1; //test
//~ cin >> t;
while (t--) void_code ();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |