oj.uz

답안 #399418

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
399418 2021-05-05T18:16:48 Z proma 벽 칠하기 (APIO20_paint) C++17
12 / 100
 42 ms 9932 KB 
#include <bits/stdc++.h>

using namespace std;

int minimumInstructions (int N, int M, int K, vector <int> C, vector <int> A, vector <vector<int>> B) {
    int P[N], L[N], G[N+M], pos[K];

    memset(pos, -1, sizeof(pos));
    for (int i = 0; i < M; i ++) {
        for (int j = 0; j < A[i]; j ++) {
            pos[B[i][j]] = i;
        }
    }

    memset(P, 0, sizeof(P));
    int lft = 0;
    if (pos[C[0]] == -1) return -1;
    for (int y = 1; y < N; y ++) {
        if (pos[C[y]] == -1) return -1;
        if (pos[C[y]] != (pos[C[y-1]] + 1) % M) {
            for (int i = lft; i <= y - M; i ++) {
                P[i] = 1;
            }
            lft = y;
        }
    }

    for (; lft <= N - M; lft ++)
        P[lft] = 1;

    if (P[0]) L[0] = 0;
    else return -1;
    for (int i = 1; i < N; i ++) {
        if (P[i]) L[i] = i;
        else L[i] = L[i-1];
    }


    memset(G, 0, sizeof(G));
    for (int i = N - 1; i >= 0; i --) {
        if (i - L[i] >= M) {
            return -1;
        }
        G[i] = 1 + G[L[i] + M];
    }

    return G[0];
}
/*
void solve () {
    int N, M, K;
    vector <int> C, A;
    vector <vector<int>> B;

    cin >> N >> M >> K;

    C.resize(N);
    A.resize(M);
    B.resize(M);

    for (int i = 0; i < N; i ++) {
        cin >> C[i];
    }
    for (int i = 0; i < M; i ++) {
        cin >> A[i];
        B[i].resize(A[i]);
        for (int j = 0; j < A[i]; j ++) {
            cin >> B[i][j];
        }
    }

    cout << minimumInstructions(N, M, K, C, A, B) << endl;
}

int main () {

    solve();

    return 0;
}
*/

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 716 KB Output is correct
14 Correct 1 ms 716 KB Output is correct
15 Correct 1 ms 716 KB Output is correct
16 Correct 1 ms 716 KB Output is correct
17 Correct 1 ms 716 KB Output is correct
18 Correct 1 ms 716 KB Output is correct
19 Correct 1 ms 716 KB Output is correct
20 Correct 1 ms 716 KB Output is correct
21 Correct 2 ms 716 KB Output is correct
22 Correct 13 ms 1996 KB Output is correct
23 Correct 18 ms 2044 KB Output is correct
24 Correct 14 ms 1996 KB Output is correct
25 Correct 3 ms 692 KB Output is correct
26 Correct 3 ms 684 KB Output is correct
27 Correct 3 ms 540 KB Output is correct
28 Correct 3 ms 564 KB Output is correct
29 Correct 3 ms 460 KB Output is correct
30 Correct 3 ms 460 KB Output is correct
31 Correct 7 ms 1484 KB Output is correct
32 Correct 7 ms 1560 KB Output is correct
33 Correct 7 ms 1588 KB Output is correct
34 Correct 7 ms 1560 KB Output is correct
35 Correct 7 ms 1560 KB Output is correct
36 Correct 7 ms 1560 KB Output is correct
37 Correct 17 ms 2536 KB Output is correct
38 Correct 17 ms 2464 KB Output is correct
39 Correct 17 ms 2500 KB Output is correct
40 Correct 13 ms 2252 KB Output is correct
41 Correct 8 ms 1484 KB Output is correct
42 Correct 14 ms 2372 KB Output is correct
43 Correct 9 ms 1100 KB Output is correct
44 Correct 8 ms 1100 KB Output is correct
45 Correct 12 ms 1588 KB Output is correct
46 Correct 37 ms 8772 KB Output is correct
47 Correct 22 ms 5388 KB Output is correct
48 Correct 27 ms 7888 KB Output is correct
49 Correct 31 ms 6720 KB Output is correct
50 Correct 32 ms 6372 KB Output is correct
51 Correct 26 ms 4492 KB Output is correct
52 Correct 16 ms 2380 KB Output is correct
53 Correct 13 ms 2380 KB Output is correct
54 Correct 16 ms 2352 KB Output is correct
55 Correct 13 ms 1640 KB Output is correct
56 Correct 13 ms 1612 KB Output is correct
57 Correct 12 ms 1656 KB Output is correct
58 Correct 41 ms 9924 KB Output is correct
59 Correct 41 ms 9892 KB Output is correct
60 Correct 41 ms 9908 KB Output is correct
61 Correct 41 ms 9876 KB Output is correct
62 Correct 41 ms 9932 KB Output is correct
63 Correct 41 ms 9924 KB Output is correct
64 Correct 42 ms 8212 KB Output is correct
65 Correct 40 ms 8100 KB Output is correct
66 Correct 40 ms 8128 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 716 KB Output is correct
14 Correct 1 ms 716 KB Output is correct
15 Correct 1 ms 716 KB Output is correct
16 Correct 1 ms 716 KB Output is correct
17 Correct 1 ms 716 KB Output is correct
18 Correct 1 ms 716 KB Output is correct
19 Correct 1 ms 716 KB Output is correct
20 Correct 1 ms 716 KB Output is correct
21 Correct 2 ms 716 KB Output is correct
22 Incorrect 1 ms 204 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -