# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
371282 | sam571128 | JJOOII 2 (JOI20_ho_t2) | C++14 | 347 ms | 5556 KiB |
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>
#define int long long
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 2e5+5;
int cntj[N], cnto[N], cnti[N];
signed main(){
fastio
int n,k;
cin >> n >> k;
string s;
cin >> s;
s = '$' + s;
cntj[n+1] = cnto[n+1] = cnti[n+1] = 1e18;
for(int i = 1;i <= n;i++){
cntj[i] = cntj[i-1], cnto[i] = cnto[i-1], cnti[i] = cnti[i-1];
if(s[i]=='J'){
cntj[i]++;
}else if(s[i]=='O'){
cnto[i]++;
}else if(s[i]=='I'){
cnti[i]++;
}
}
auto check = [&](int i, int j){
int idx = lower_bound(cntj+1,cntj+n+1,cntj[i-1]+k)-cntj;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |