Submission #770689

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
770689	2023-07-01 17:48:55	JellyTheOctopus	JJOOII 2 (JOI20_ho_t2)	C++17	13 / 100	2076 ms	3572 KiB

ho_t2

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
int N, K;
string s;
int main() {
    cin >> N >> K >> s;
    vector<int> J, O, I;
    for (int i = 0; i < (int)s.size(); i++) {
        if (s[i] == 'J') J.push_back(i+1);
        else if (s[i] == 'O') O.push_back(i+1);
        else I.push_back(i+1);
    }
    O.push_back(INT_MAX);
    I.push_back(INT_MAX);
    int ans = INT_MAX;
    for (int i = 0; i+K-1 < (int)J.size(); i++) {
        int cur = 0;
        vector<int> arr;
        for (int j = i; j < i+K; j++) {
            if (!arr.empty()) cur += J[j]-arr.back()-1;
            arr.push_back(J[j]);
        }
        int u = upper_bound(O.begin(), O.end(), arr.back())-O.begin();
        if (u == INT_MAX) break;
        bool flag = false;
        for (int j = u; j < u+K; j++) {
            if (O[j] == INT_MAX) {
                flag = true;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 1 / 1
• Subtask 2: 12 / 12
• Subtask 3: 0 / 87