oj.uz

답안 #413572

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
413572 2021-05-29T00:16:29 Z Ozy JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 54 ms 11332 KB 
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = (a); i <= (b); i++)
#define repa(i,a,b) for (int i = (a); i >= (b); i--)
#define lli long long int
#define debugsl(a) cout << #a << " = " << a << ", "
#define debug(a) cout << #a << " = " << a << endl

#define pos first
#define id second
#define MAX 200000

lli n,k,a,res,J,O,I,o,i;
lli Jid[MAX+2],Oid[MAX+2],Iid[MAX+2],ini[MAX+2];
char arr[200002];
set< pair <lli,lli> > Os, Is;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> k;
    rep(i,1,n) {
        cin >> arr[i];
        if (arr[i] == 'J') {
            J++;
            if (J >= k) Jid[J-k+1] = i;
            ini[J] = i;
        }
        else if (arr[i] == 'O') {
            O++;
            Os.insert({i,O});
            if (O >= k) Oid[O-k+1] = i;
        }
        else if (arr[i] == 'I') {
            I++;
            Is.insert({i,I});
            if (I >= k) Iid[I-k+1] = i;
        }
    }

    res = -1;
    rep(j,1,J) {
        if (Jid[j] == 0) break;

        if (Os.upper_bound({Jid[j],0}) == Os.end()) break;
        o = (*Os.upper_bound({Jid[j],0})).id;
        if (Oid[o] == 0) break;


        if (Is.upper_bound({Oid[o],0}) == Is.end()) break;
        i = (*Is.upper_bound({Oid[o],0})).id;
        if (Iid[i] == 0) break;

        a = (Iid[i]-ini[j]+1)-(k*3);
        if (a < res || res == -1) res = a;
    }

    cout << res;

    return 0;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 2 ms 448 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 324 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 1 ms 452 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 2 ms 332 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 1 ms 460 KB Output is correct
34 Correct 1 ms 460 KB Output is correct
35 Correct 1 ms 460 KB Output is correct

Subtask #3
87.0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 2 ms 448 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 324 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 1 ms 452 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 2 ms 332 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 1 ms 460 KB Output is correct
34 Correct 1 ms 460 KB Output is correct
35 Correct 1 ms 460 KB Output is correct
36 Correct 47 ms 10284 KB Output is correct
37 Correct 54 ms 11332 KB Output is correct
38 Correct 51 ms 11016 KB Output is correct
39 Correct 47 ms 10852 KB Output is correct
40 Correct 39 ms 10604 KB Output is correct
41 Correct 45 ms 10956 KB Output is correct
42 Correct 52 ms 11080 KB Output is correct
43 Correct 22 ms 6632 KB Output is correct
44 Correct 29 ms 8212 KB Output is correct
45 Correct 37 ms 10564 KB Output is correct
46 Correct 35 ms 10572 KB Output is correct
47 Correct 39 ms 10564 KB Output is correct
48 Correct 37 ms 10564 KB Output is correct
49 Correct 23 ms 7128 KB Output is correct
50 Correct 37 ms 10540 KB Output is correct
51 Correct 37 ms 10564 KB Output is correct
52 Correct 36 ms 9420 KB Output is correct
53 Correct 38 ms 9924 KB Output is correct
54 Correct 47 ms 11124 KB Output is correct
55 Correct 43 ms 10052 KB Output is correct
56 Correct 39 ms 9584 KB Output is correct