oj.uz

Submission #974913

# Submission time Handle Problem Language Result Execution time Memory
974913 2024-05-04T06:51:42 Z berr JJOOII 2 (JOI20_ho_t2) C++17
13 / 100
 151 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std; 
#define int long long
const int N=5005, INF=1e18;
 
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
    int n, k; cin >> n >> k;
    vector<vector<int>> pref(n, vector<int>(n, 0));

    string s; cin >> s;

    for(int i =0; i<n; i++){
        if(s[i]=='J') pref[0][i]++;
        else if(s[i]=='O') pref[1][i]++;
        else pref[2][i]++;
        if(i>0){
            pref[0][i]+=pref[0][i-1];
            pref[1][i]+=pref[1][i-1];
            pref[2][i]+=pref[2][i-1];
        } 
    }

    auto val=[&](int l, int r, int type){
        if(l>r) return 0LL;
        if(r==n) return 0LL;

        if(l==0) return pref[type][r];
        return pref[type][r]-pref[type][l-1];
    };


    int posj=0, poso=0, posi=0, ans=n+1;
    for(int i=0; i<n; i++){
        while(posj<n&&val(i, posj, 0)<k) posj++;

        while(poso<n&&val(posj+1, poso, 1)<k) poso++;
        while(posi<n&&val(poso+1, posi, 2)<k) posi++;

        if(val(i, posj, 0)==k && val(posj+1, poso, 1)==k && val(poso+1, posi, 2)==k){
            ans=min(ans, posi-i+1-k*3);
        }
    }

    if(ans==n+1) cout<<-1;
    else cout<<ans;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 460 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 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 460 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 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 21 ms 52316 KB Output is correct
16 Correct 34 ms 71000 KB Output is correct
17 Correct 26 ms 70996 KB Output is correct
18 Correct 10 ms 27484 KB Output is correct
19 Correct 27 ms 70848 KB Output is correct
20 Correct 29 ms 70992 KB Output is correct
21 Correct 27 ms 70792 KB Output is correct
22 Correct 22 ms 59996 KB Output is correct
23 Correct 8 ms 19808 KB Output is correct
24 Correct 27 ms 71056 KB Output is correct
25 Correct 27 ms 71004 KB Output is correct
26 Correct 27 ms 70964 KB Output is correct
27 Correct 29 ms 71004 KB Output is correct
28 Correct 25 ms 66908 KB Output is correct
29 Correct 28 ms 70840 KB Output is correct
30 Correct 26 ms 71004 KB Output is correct
31 Correct 6 ms 15708 KB Output is correct
32 Correct 27 ms 71004 KB Output is correct
33 Correct 28 ms 71004 KB Output is correct
34 Correct 28 ms 71004 KB Output is correct
35 Correct 29 ms 71040 KB Output is correct

Subtask #3
0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 460 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 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 21 ms 52316 KB Output is correct
16 Correct 34 ms 71000 KB Output is correct
17 Correct 26 ms 70996 KB Output is correct
18 Correct 10 ms 27484 KB Output is correct
19 Correct 27 ms 70848 KB Output is correct
20 Correct 29 ms 70992 KB Output is correct
21 Correct 27 ms 70792 KB Output is correct
22 Correct 22 ms 59996 KB Output is correct
23 Correct 8 ms 19808 KB Output is correct
24 Correct 27 ms 71056 KB Output is correct
25 Correct 27 ms 71004 KB Output is correct
26 Correct 27 ms 70964 KB Output is correct
27 Correct 29 ms 71004 KB Output is correct
28 Correct 25 ms 66908 KB Output is correct
29 Correct 28 ms 70840 KB Output is correct
30 Correct 26 ms 71004 KB Output is correct
31 Correct 6 ms 15708 KB Output is correct
32 Correct 27 ms 71004 KB Output is correct
33 Correct 28 ms 71004 KB Output is correct
34 Correct 28 ms 71004 KB Output is correct
35 Correct 29 ms 71040 KB Output is correct
36 Runtime error 151 ms 262144 KB Execution killed with signal 9
37 Halted 0 ms 0 KB -