| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 560969 | Aktan | JJOOII 2 (JOI20_ho_t2) | C++14 | 12 ms | 3300 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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T>
using ordered_set = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define int long long
#define ft first
#define sc second
const int mod=1e9+7,INF=1e17,N=1e5;
main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n,k;
cin >> n >> k;
string s;
cin >> s;
int ans=INF;
vector<int> a,b,c;
for(int i=0;i<n;i++){
if(s[i]=='J'){
a.push_back(i);
}
else if(s[i]=='O'){
b.push_back(i);
}
else{
c.push_back(i);
}
}
for(int i=k-1;i<b.size();i++){
int l=b[i-k+1],r=b[i];
int x=--lower_bound(a.begin(),a.end(),l)-a.begin(),y=lower_bound(c.begin(),c.end(),r)-c.begin();
x-=k;
x++;
y+=k;
y--;
if(x>=0 && y<c.size()){
ans=min(ans,(c[y]-a[x]+1)-(k*3));
}
}
if(ans==INF){
cout << -1;
return 0;
}
cout << ans;
}
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... | ||||
