oj.uz

Submission #977818

# Submission time Handle Problem Language Result Execution time Memory
977818 2024-05-08T11:24:55 Z UltraFalcon JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 5 ms 1172 KB 
#ifndef DEBUG
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2,abm,mmx,fma,popcnt")
#endif

#include <bits/stdc++.h>
// #define int long long
using ll = long long;

using namespace std;

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, k;
    cin >> n >> k;

    string s; cin >> s;

    int lj = 0;
    while (lj < n && s[lj] != 'J') lj++;
    int rj = lj;
    int j_cnt = 1;
    int cur_cost = 0;
    while ((rj+1)<n && j_cnt<k) {
        rj++;
        j_cnt += s[rj] == 'J';
        // cur_cost += s[rj] != 'J';
    }
    int ro = rj;
    int o_cnt = 0;
    while ((ro+1)<n && o_cnt < k) {
        ro++;
        o_cnt += s[ro] == 'O';
        // cur_cost += s[ro] != 'O';
    }
    int ri = ro;
    int i_cnt = 0;
    while ((ri+1)<n && i_cnt<k) {
        ri++;
        i_cnt += s[ri] == 'I';
    }

    if (j_cnt<k || o_cnt<k || i_cnt<k) {
        cout << -1 << "\n";
        return 0;
    }

    cur_cost = (ri-lj+1) - 3*k;
    int res = cur_cost;
    while (ri < n) {
        rj++;
        while (rj < n && s[rj] != 'J') {
            // cur_cost += s[rj] != 'J';
            o_cnt -= (s[rj]=='O' && rj<=ro);
            i_cnt -= (s[rj]=='I' && rj > ro && rj<=ri);
            rj++;
        }
        lj++;
        while (lj<n && s[lj]!='J') {
            // cur_cost -= s[lj] != 'J';
            lj++;
        }

        ro = max(ro, rj);
        while ((ro+1)<n && o_cnt<k) {
            ro++;
            o_cnt += s[ro]=='O';
            i_cnt -= (s[ro]=='I' && ro<=ri);
        }

        ri = max(ri, ro);
        while ((ri+1)<n && i_cnt<k) {
            ri++;
            i_cnt += s[ri]=='I';
        }

        if (rj>=n || ro>=n || ri >= n) break;
        if (j_cnt<k || o_cnt<k || i_cnt<k) break;

        cur_cost = (ri-lj+1) - 3*k;
        res = min(res, cur_cost);
    }
    
    cout << res << "\n";

}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 356 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 408 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 356 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 408 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 4 ms 848 KB Output is correct
37 Correct 4 ms 860 KB Output is correct
38 Correct 4 ms 1112 KB Output is correct
39 Correct 4 ms 856 KB Output is correct
40 Correct 2 ms 860 KB Output is correct
41 Correct 3 ms 860 KB Output is correct
42 Correct 5 ms 980 KB Output is correct
43 Correct 1 ms 600 KB Output is correct
44 Correct 1 ms 860 KB Output is correct
45 Correct 1 ms 860 KB Output is correct
46 Correct 1 ms 1008 KB Output is correct
47 Correct 1 ms 860 KB Output is correct
48 Correct 1 ms 860 KB Output is correct
49 Correct 1 ms 720 KB Output is correct
50 Correct 1 ms 952 KB Output is correct
51 Correct 1 ms 1172 KB Output is correct
52 Correct 1 ms 856 KB Output is correct
53 Correct 1 ms 860 KB Output is correct
54 Correct 1 ms 860 KB Output is correct
55 Correct 1 ms 856 KB Output is correct
56 Correct 1 ms 860 KB Output is correct