oj.uz

답안 #974916

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
974916 2024-05-04T06:55:07 Z berr JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 10 ms 6672 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(3, 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct

Subtask #3
87.0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 10 ms 6236 KB Output is correct
37 Correct 8 ms 6492 KB Output is correct
38 Correct 9 ms 6492 KB Output is correct
39 Correct 8 ms 6492 KB Output is correct
40 Correct 8 ms 6492 KB Output is correct
41 Correct 7 ms 6492 KB Output is correct
42 Correct 7 ms 6492 KB Output is correct
43 Correct 4 ms 4188 KB Output is correct
44 Correct 7 ms 5212 KB Output is correct
45 Correct 6 ms 6492 KB Output is correct
46 Correct 6 ms 6488 KB Output is correct
47 Correct 6 ms 6488 KB Output is correct
48 Correct 6 ms 6492 KB Output is correct
49 Correct 4 ms 4440 KB Output is correct
50 Correct 6 ms 6492 KB Output is correct
51 Correct 6 ms 6588 KB Output is correct
52 Correct 5 ms 6488 KB Output is correct
53 Correct 5 ms 6488 KB Output is correct
54 Correct 5 ms 6492 KB Output is correct
55 Correct 5 ms 6672 KB Output is correct
56 Correct 5 ms 6492 KB Output is correct