# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1104007 | Luvidi | JJOOII 2 (JOI20_ho_t2) | C++17 | 1 ms | 592 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>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define fs first
#define sc second
#define pb push_back
void solve() {
int n,k;
cin>>n>>k;
string s;
cin>>s;
int pre[n];
int idx=0,cnt=0;
for(int i=0;i<n;i++){
cnt+=s[i]=='J';
while(cnt-(s[idx]=='J')>=k){
cnt-=s[idx]=='J';
idx++;
}
if(cnt==k)pre[i]=i-idx+1;
else pre[i]=1e9;
}
int suf[n];
idx=n-1;
cnt=0;
for(int i=n-1;i>-1;i--){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |