oj.uz

Submission #349921

# Submission time Handle Problem Language Result Execution time Memory
349921 2021-01-18T17:27:55 Z shivensinha4 JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 28 ms 13304 KB 
#include "bits/stdc++.h"
using namespace std;
#define for_(i, s, e) for (int i = s; i < (int) e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
#define endl '\n'


int main() {
#ifdef mlocal
    freopen("test.in", "r", stdin);
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, k; cin >> n >> k;
    string s; cin >> s;
    vector<vi> pref(n, vi(3));
    for_(i, 0, n) {
        if (s[i] == 'J') pref[i][0]++;
        else if (s[i] == 'O') pref[i][1]++;
        else pref[i][2]++;
    }

    for_(i, 1, n) for_(j, 0, 3) pref[i][j] += pref[i-1][j];

    vi pre(n), curr(n);
    for_(i, 0, n) pre[i] = i;

    for (int j = 2; j >= 0; j--) {
        curr.assign(n, n);
        int pt = n;
        for (int i = n-1; i >= 0; i--) {
            while (pt > i and pref[pt-1][j] - (i > 0 ? pref[i-1][j] : 0) >= k) pt--;
            curr[i] = pt;
            if (pt != n) curr[i] = pre[pt];
        }

        swap(curr, pre);
    }

    int ans = n;
    for_(i, 0, n) if (pre[i] != n) ans = min(ans, pre[i]-i+1-3*k);
    cout << (ans == n ? -1 : ans) << endl;

    return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 1 ms 492 KB Output is correct
34 Correct 1 ms 492 KB Output is correct
35 Correct 1 ms 492 KB Output is correct
36 Correct 24 ms 12280 KB Output is correct
37 Correct 26 ms 13304 KB Output is correct
38 Correct 26 ms 13304 KB Output is correct
39 Correct 27 ms 13176 KB Output is correct
40 Correct 27 ms 13304 KB Output is correct
41 Correct 27 ms 13304 KB Output is correct
42 Correct 28 ms 13304 KB Output is correct
43 Correct 17 ms 8428 KB Output is correct
44 Correct 20 ms 10360 KB Output is correct
45 Correct 26 ms 13304 KB Output is correct
46 Correct 26 ms 13304 KB Output is correct
47 Correct 26 ms 13304 KB Output is correct
48 Correct 26 ms 13304 KB Output is correct
49 Correct 18 ms 8952 KB Output is correct
50 Correct 26 ms 13304 KB Output is correct
51 Correct 26 ms 13304 KB Output is correct
52 Correct 22 ms 12792 KB Output is correct
53 Correct 23 ms 13304 KB Output is correct
54 Correct 23 ms 13304 KB Output is correct
55 Correct 22 ms 13304 KB Output is correct
56 Correct 22 ms 13304 KB Output is correct