oj.uz

Submission #367770

# Submission time Handle Problem Language Result Execution time Memory
367770 2021-02-18T09:44:49 Z KoD Painting Walls (APIO20_paint) C++17
12 / 100
 85 ms 16156 KB 
#ifndef LOCAL
#include "paint.h"
#endif

#include <vector>

template <class T>
using Vec = std::vector<T>;

int rem_euclid(int x, const int y) {
    x %= y;
    return x < 0 ? x + y : x;
}

int minimumInstructions(int N, int M, int K, Vec<int> C, Vec<int>, Vec<Vec<int>> B) {
    Vec<Vec<int>> store(K);
    for (int i = 0; i < M; ++i) {
        for (const auto c: B[i]) {
            store[c].push_back(i);
        }
    }
    Vec<Vec<int>> appear(M);
    for (int i = 0; i < N; ++i) {
        for (const auto j: store[C[i]]) {
            appear[rem_euclid(j - i, M)].push_back(i);
        }
    }
    Vec<int> max_right(N);
    for (const auto &vec: appear) {
        int last = N + 1;
        int to_right = 0;
        for (int i = (int) vec.size() - 1; i >= 0; --i) {
            const auto k = vec[i];
            if (k + 1 != last) {
                to_right = 0;
            }
            to_right += 1;
            max_right[k] = to_right;
            last = k;
        }
    }
    Vec<int> paint;
    for (int i = 0; i < N; ++i) {
        if (max_right[i] >= M) {
            paint.push_back(i);
        }
    }
    int ret = 0;
    int right = 0;
    int idx = 0;
    while (right < N) {
        while (idx < (int) paint.size() && paint[idx] <= right) {
            idx += 1;
        }
        if (idx == 0) {
            return -1;
        }
        const auto left = paint[idx - 1];
        if (left + M <= right) {
            return -1;
        }
        ret += 1;
        right = left + M;
    }
    return ret;
}

#ifdef LOCAL
int main() {

    return 0;
}
#endif

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 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 0 ms 364 KB Output is correct
13 Correct 2 ms 2668 KB Output is correct
14 Correct 2 ms 2668 KB Output is correct
15 Correct 2 ms 2668 KB Output is correct
16 Correct 3 ms 2668 KB Output is correct
17 Correct 2 ms 2668 KB Output is correct
18 Correct 2 ms 2668 KB Output is correct
19 Correct 2 ms 2668 KB Output is correct
20 Correct 2 ms 2668 KB Output is correct
21 Correct 2 ms 2668 KB Output is correct
22 Correct 29 ms 7148 KB Output is correct
23 Correct 26 ms 7168 KB Output is correct
24 Correct 27 ms 7148 KB Output is correct
25 Correct 3 ms 876 KB Output is correct
26 Correct 3 ms 876 KB Output is correct
27 Correct 3 ms 748 KB Output is correct
28 Correct 3 ms 748 KB Output is correct
29 Correct 3 ms 748 KB Output is correct
30 Correct 3 ms 620 KB Output is correct
31 Correct 12 ms 4332 KB Output is correct
32 Correct 11 ms 4332 KB Output is correct
33 Correct 11 ms 4332 KB Output is correct
34 Correct 12 ms 4332 KB Output is correct
35 Correct 11 ms 4332 KB Output is correct
36 Correct 11 ms 4332 KB Output is correct
37 Correct 34 ms 7916 KB Output is correct
38 Correct 34 ms 7916 KB Output is correct
39 Correct 35 ms 7916 KB Output is correct
40 Correct 13 ms 2660 KB Output is correct
41 Correct 8 ms 1644 KB Output is correct
42 Correct 15 ms 2408 KB Output is correct
43 Correct 10 ms 1640 KB Output is correct
44 Correct 9 ms 1388 KB Output is correct
45 Correct 14 ms 2284 KB Output is correct
46 Correct 55 ms 15076 KB Output is correct
47 Correct 34 ms 9456 KB Output is correct
48 Correct 39 ms 12140 KB Output is correct
49 Correct 60 ms 13036 KB Output is correct
50 Correct 65 ms 12652 KB Output is correct
51 Correct 48 ms 9452 KB Output is correct
52 Correct 15 ms 2788 KB Output is correct
53 Correct 15 ms 2788 KB Output is correct
54 Correct 16 ms 2448 KB Output is correct
55 Correct 17 ms 2284 KB Output is correct
56 Correct 14 ms 2224 KB Output is correct
57 Correct 15 ms 2412 KB Output is correct
58 Correct 62 ms 16100 KB Output is correct
59 Correct 62 ms 16100 KB Output is correct
60 Correct 62 ms 16100 KB Output is correct
61 Correct 64 ms 16100 KB Output is correct
62 Correct 62 ms 16100 KB Output is correct
63 Correct 63 ms 16156 KB Output is correct
64 Correct 84 ms 15596 KB Output is correct
65 Correct 85 ms 15596 KB Output is correct
66 Correct 84 ms 15596 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 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 0 ms 364 KB Output is correct
13 Correct 2 ms 2668 KB Output is correct
14 Correct 2 ms 2668 KB Output is correct
15 Correct 2 ms 2668 KB Output is correct
16 Correct 3 ms 2668 KB Output is correct
17 Correct 2 ms 2668 KB Output is correct
18 Correct 2 ms 2668 KB Output is correct
19 Correct 2 ms 2668 KB Output is correct
20 Correct 2 ms 2668 KB Output is correct
21 Correct 2 ms 2668 KB Output is correct
22 Incorrect 1 ms 364 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -