oj.uz

답안 #343020

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
343020 2021-01-03T11:06:25 Z blue JJOOII 2 (JOI20_ho_t2) C++11
100 / 100
 26 ms 5356 KB 
#include <iostream>
#include <vector>
using namespace std;

int main()
{
    int N, K;
    cin >> N >> K;

    vector<int> J(N+1, 0), O(N+1, 0), I(N+1, 0);
    char c;

    for(int i = 1; i <= N; i++)
    {
        cin >> c;
        J[i] = J[i-1];
        O[i] = O[i-1];
        I[i] = I[i-1];

        if(c == 'J') J[i]++;
        else if(c == 'O') O[i]++;
        else if(c == 'I') I[i]++;
    }

    vector<int> dpJ(N+1, 1e9), dpO(N+2, 1e9), dpI(N+1, 1e9);

    int prev = 0;
    for(int i = 1; i <= N; i++)
    {
        if(J[i] < K) continue;

        while(J[i] - J[prev+1] >= K) prev++;
        dpJ[i] = min(dpJ[i-1] + 1, i - prev - K);
    }
    // for(int i = 1; i <= N; i++) cout << dpJ[i] << ' ';
    // cout << '\n';






    prev = N;
    for(int i = N; i >= 1; i--)
    {
        if(I[N] - I[i-1] < K) continue;

        while(I[prev-1] - I[i-1] >= K) prev--;
        dpI[i] = min(dpI[i+1] + 1, prev - (i-1) - K);
    }
    // for(int i = 1; i <= N; i++) cout << dpI[i] << ' ';
    // cout << '\n';

    int res = 1e9;

    int j = 1;
    for(int i = 1; i <= N; i++)
    {
        while(j <= N && O[j] - O[i-1] < K) j++;
        if(j == N+1) break;

        res = min(res, dpJ[i] + j-i-1 - K + dpI[j]);
    }

    if(res == 1e9) cout << "-1\n";
    else cout << res << '\n';
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 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 364 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 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 364 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 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct

Subtask #3
87.0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 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 364 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 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 22 ms 4844 KB Output is correct
37 Correct 24 ms 5356 KB Output is correct
38 Correct 25 ms 5228 KB Output is correct
39 Correct 25 ms 5228 KB Output is correct
40 Correct 24 ms 5228 KB Output is correct
41 Correct 25 ms 5228 KB Output is correct
42 Correct 26 ms 5228 KB Output is correct
43 Correct 15 ms 3308 KB Output is correct
44 Correct 19 ms 4076 KB Output is correct
45 Correct 25 ms 5228 KB Output is correct
46 Correct 24 ms 5228 KB Output is correct
47 Correct 24 ms 5228 KB Output is correct
48 Correct 24 ms 5228 KB Output is correct
49 Correct 16 ms 3564 KB Output is correct
50 Correct 26 ms 5248 KB Output is correct
51 Correct 24 ms 5228 KB Output is correct
52 Correct 22 ms 4972 KB Output is correct
53 Correct 21 ms 5228 KB Output is correct
54 Correct 20 ms 5228 KB Output is correct
55 Correct 19 ms 5228 KB Output is correct
56 Correct 19 ms 5228 KB Output is correct