| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1114941 | AdamGS | JJOOII 2 (JOI20_ho_t2) | C++17 | 1 ms | 336 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;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n,k,o;
string napis;
cin >> n >> k >> napis;
queue<int>indexJ,indexI,indexO;
vector<int>J1,J2,I1,I2,O1,O2;
for(int i=0;i<n;++i){
if(napis[i]=='O')
indexO.push(i);
if(napis[i]=='J')
indexJ.push(i);
if(napis[i]=='I')
indexI.push(i);
if(indexJ.size()==k){
J1.push_back(indexJ.front());
J2.push_back(i);
indexJ.pop();
}
if(indexO.size()==k){
O1.push_back(indexO.front());
O2.push_back(i);
indexO.pop();
}
if(indexI.size()==k){
I1.push_back(indexI.front());
I2.push_back(i);
indexI.pop();
}
}
int wynik=2000007;
vector<int>::iterator it1,it2;
for(int i=0;i<J1.size();++i){
it1=lower_bound(O1.begin(),O1.end(),J2[i]);
if(it1!=O1.end()){
it2=lower_bound(I1.begin(),I1.end(),O2[it1-O1.begin()]);
//cout << O2[it1-O1.begin()];
if(it2!=I1.end()){
int s3=I2[it2-I1.begin()]-J1[i]+3-3*k;
wynik=min(s3,wynik);
}
}
}
if(wynik!=2000007)
cout << wynik;
else
cout << -1;
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... | ||||
