oj.uz

Submission #573466

# Submission time Handle Problem Language Result Execution time Memory
573466 2022-06-06T16:48:34 Z teki JJOOII 2 (JOI20_ho_t2) C++11
100 / 100
 28 ms 3288 KB 
#include <bits/stdc++.h>

typedef long long ll;

#define pb push_back
#define MS(x,y) memset((x),(y),sizeof((x)))
#define MN 1000000007

using namespace std;

int main()
{
    #if LOCAL_DEBUG
        fstream cin("in.txt");
    #endif

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

    int n,k;
    cin>>n>>k;

    int pref[3][n+5];
    MS(pref,0);

    /// J pa O pa I

    string s;
    cin>>s;

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

    int curr[3];
    int res = INT_MAX/2;

    for (int i = 0; i<=n; i++) {
        for (int j = 0; j<3; j++) curr[j] = pref[j][i];

        int newPos = i;
        int resC = 0;

        for (int j = 0; j<3; j++) {
            auto itJ = lower_bound(pref[j]+newPos,pref[j]+(n+1),curr[j]+k);

            if (itJ == pref[j]+(n+1)) {resC = INT_MAX/2; break; }

            newPos = itJ-pref[j];

            for (int k = 0; k<3; k++) if (k != j) resC += pref[k][newPos]-curr[k];
            for (int k = 0; k<3; k++) curr[k] = pref[k][newPos];
        }

        res = min(res,resC);
    }

    if (res != INT_MAX/2) cout<<res<<endl;
    else cout<<-1<<endl;

    return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 320 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 324 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 316 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 324 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 22 ms 3028 KB Output is correct
37 Correct 27 ms 3192 KB Output is correct
38 Correct 24 ms 3168 KB Output is correct
39 Correct 25 ms 3160 KB Output is correct
40 Correct 17 ms 3192 KB Output is correct
41 Correct 22 ms 3248 KB Output is correct
42 Correct 28 ms 3232 KB Output is correct
43 Correct 9 ms 2132 KB Output is correct
44 Correct 11 ms 2644 KB Output is correct
45 Correct 14 ms 3168 KB Output is correct
46 Correct 14 ms 3168 KB Output is correct
47 Correct 14 ms 3168 KB Output is correct
48 Correct 14 ms 3200 KB Output is correct
49 Correct 9 ms 2384 KB Output is correct
50 Correct 16 ms 3280 KB Output is correct
51 Correct 15 ms 3288 KB Output is correct
52 Correct 7 ms 3080 KB Output is correct
53 Correct 8 ms 3184 KB Output is correct
54 Correct 11 ms 3200 KB Output is correct
55 Correct 8 ms 3160 KB Output is correct
56 Correct 6 ms 3164 KB Output is correct