# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
532137 | scottchou | JJOOII 2 (JOI20_ho_t2) | C++17 | 8 ms | 2176 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<iostream>
#include<vector>
using namespace std;
vector<int> ipoint, opoint, jpoint;
int const N = 2e5 + 5;
int ov[N];
int inf = 1e9;
string s;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
cin >> s;
for(int i = 0; i < n; i++){
if(s[i] == 'I'){
ipoint.push_back(i);
}else if(s[i] == 'O'){
opoint.push_back(i);
}else{
jpoint.push_back(i);
}
}
int now = ipoint.size() - 1, minn = inf;
for(int i = opoint.size() - 1; i >= 0; i--){
if(i < k - 1){
ov[i] = inf;
continue;
}
int p = opoint[i];
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... |