# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
770706 | JellyTheOctopus | JJOOII 2 (JOI20_ho_t2) | C++17 | 7 ms | 3868 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 f first
#define s second
int N, K;
string str;
int main() {
cin >> N >> K >> str;
vector<int> J, O, I;
for (int i = 0; i < (int)str.size(); i++) {
if (str[i] == 'J') {
J.push_back(i+1);
}
else if (str[i] == 'O') {
O.push_back(i+1);
}
else {
I.push_back(i+1);
}
}
vector<pair<int, int>> A, B, C;
for (int i = 0; i+K-1 < (int)J.size(); i++) {
A.emplace_back(J[i], J[K+i-1]);
}
for (int i = 0; i+K-1 < (int)O.size(); i++) {
B.emplace_back(O[i], O[K+i-1]);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |