oj.uz

Submission #1051965

# Submission time Handle Problem Language Result Execution time Memory
1051965 2024-08-10T10:49:29 Z fryingduc JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 6 ms 3924 KB 
#include "bits/stdc++.h"
using namespace std;

const int maxn = 2e5 + 5;
int n, k, a[maxn], pref[maxn], suf[maxn];
int ps[maxn];

string s;

void solve() {
    cin >> n >> k >> s;
    s = ' ' + s;
    vector<int> lst;
    for(int i = 1; i <= n; ++i) {
        ps[i] = ps[i - 1] + (s[i] == 'O');
        if(s[i] != 'J') continue;
        lst.push_back(i);
        pref[i] = -1;
        if((int)lst.size() < k) continue;
        int pos = lst[(int)lst.size() - k];
        
        pref[i] = (i - pos - k + 1);
    }
    lst.clear();
    memset(suf, 0x3f, sizeof(suf));
    for(int i = n; i; --i) {
        if(s[i] == 'I') {
            lst.push_back(i);
            if((int)lst.size() >= k) {
                int pos = lst[(int)lst.size() - k];
                suf[i] = (pos - k + 1);
            }
        }
    }
    for(int i = n - 1; i; --i) {
        suf[i] = min(suf[i], suf[i + 1]);
    }
    int ans = 1e9;
    for(int i = 1; i <= n; ++i) {
        if(s[i] != 'J' || pref[i] < 0) continue;
        int x = lower_bound(ps + 1, ps + n + 1, ps[i] + k) - ps;
        if(x > n) continue;
        ans = min(ans, (x - i - k) + pref[i] + suf[x + 1] - x - 1);
    }
    
    cout << (ans == 1e9 ? -1 : ans);
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    solve();
    return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2392 KB Output is correct
13 Correct 0 ms 2392 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 0 ms 2392 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 1 ms 2648 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 0 ms 2396 KB Output is correct
26 Correct 0 ms 2396 KB Output is correct
27 Correct 0 ms 2396 KB Output is correct
28 Correct 1 ms 2392 KB Output is correct
29 Correct 0 ms 2396 KB Output is correct
30 Correct 0 ms 2396 KB Output is correct
31 Correct 0 ms 2396 KB Output is correct
32 Correct 0 ms 2396 KB Output is correct
33 Correct 1 ms 2392 KB Output is correct
34 Correct 0 ms 2512 KB Output is correct
35 Correct 0 ms 2508 KB Output is correct
36 Correct 5 ms 3632 KB Output is correct
37 Correct 6 ms 3876 KB Output is correct
38 Correct 6 ms 3876 KB Output is correct
39 Correct 5 ms 3804 KB Output is correct
40 Correct 5 ms 3748 KB Output is correct
41 Correct 5 ms 3748 KB Output is correct
42 Correct 6 ms 3876 KB Output is correct
43 Correct 3 ms 3420 KB Output is correct
44 Correct 5 ms 3408 KB Output is correct
45 Correct 5 ms 3924 KB Output is correct
46 Correct 5 ms 3872 KB Output is correct
47 Correct 5 ms 3872 KB Output is correct
48 Correct 5 ms 3876 KB Output is correct
49 Correct 3 ms 3172 KB Output is correct
50 Correct 5 ms 3792 KB Output is correct
51 Correct 5 ms 3876 KB Output is correct
52 Correct 4 ms 3580 KB Output is correct
53 Correct 4 ms 3876 KB Output is correct
54 Correct 3 ms 3676 KB Output is correct
55 Correct 2 ms 3872 KB Output is correct
56 Correct 2 ms 3620 KB Output is correct