# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
581610 | Metal_Sonic | JJOOII 2 (JOI20_ho_t2) | C++17 | 27 ms | 1812 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 sz(x) (int)(x).size()
#define all(x) x.begin() , x.end()
void setIO(string name = "") {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
if(sz(name)){
freopen((name+".in").c_str(), "r", stdin);
freopen((name+".out").c_str(), "w", stdout);
}
}
int n,k;
string s;
vector<int>J,O,I;
void run_test_case(){
cin>>n>>k>>s;
for(int i = 1; i <= n; i++){
if(s[i-1]=='J')J.push_back(i);
else if(s[i-1]=='O')O.push_back(i);
else I.push_back(i);
}
int ans = INT_MAX;
for(int i = 1; i <= n; i++){
int j = lower_bound(all(J),i)-J.begin()+k-1;
if(j>=sz(J))continue;
int o = lower_bound(all(O),J[j])-O.begin()+k-1;
if(o>=sz(O))continue;
int ii = lower_bound(all(I),O[o])-I.begin()+k-1;
if(ii>=sz(I))continue;
ans = min(ans , I[ii]-i+1-k*3);
}
cout<<(ans == INT_MAX ? -1 : ans);
}
int main() {
setIO();
int T = 1;
while(T--){
run_test_case();
}
return 0;
}
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... |