oj.uz

Submission #850052

# Submission time Handle Problem Language Result Execution time Memory
850052 2023-09-15T16:56:01 Z tvladm2009 Painting Walls (APIO20_paint) C++17
28 / 100
 24 ms 3676 KB 
#include "paint.h"

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int N = (int)1e5 + 7;
bool isok[N], act[N], ok[N];
int best[N];
vector<int> a, c;
vector<vector<int>> b;
int n, m, k;

int minimumInstructions(int N, int M, int K, vector<int> C, vector<int> A, vector<vector<int>> B) {
        n = N;
        m = M;
        k = K;
        c = C;
        a = A;
        b = B;
        assert((int)c.size() == n);
        assert((int)a.size() == m);
        assert((int)b.size() == m);
        for (int i = 0; i < m; i++) {
                assert((int)b[i].size() == a[i]);
        }

        
        for (int w = 0; w < m; w++) {
                for (auto& col : b[w]) {
                        act[col] = 1;
                }
                for (int i = 0; i < n; i++) {
                        if (act[c[i]]) {
                                isok[i * m + w] = 1;
                        }
                }
                for (auto& col : b[w]) {
                        act[col] = 0;
                }
        }

        for (int i = n - 1; i >= 0; i--) {
                for (int w = 0; w < m; w++) {
                        if (isok[i * m + w]) {
                                best[i * m + w] = 1;
                                if (i + 1 < n) {
                                        best[i * m + w] += best[(i + 1) * m + (w + 1) % m];
                                }
                        }
                }
        }
        for (int y = 0; y + m - 1 < n; y++) {
                for (int w = 0; w < m; w++) {
                        if (best[y * m + w] >= m) {
                                ok[y] = 1;
                        }
                }
        }
        vector<int> inds;
        for (int i = 0; i < n; i++) {
                if (ok[i]) {
                        inds.push_back(i);
                }
        }
        if (inds.empty()) {
                return -1;
        }
        assert((int) inds.size() >= 1);
        if (inds[0] != 0 || inds.back() != n - m) {
                return -1;
        }
        int l = 0, cost = 0;
        while (1) {
                int r = l;
                cost++;
                while (r + 1 < (int) inds.size() && inds[r + 1] <= inds[l] + m) {
                        r++;
                }
                if (r == (int) inds.size() - 1) {
                        if (l < r) {
                                cost++;
                        }
                        break;
                }
                if (l == r) {
                        return -1;
                }
                l = r;
        }
        return cost;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 856 KB Output is correct
14 Correct 1 ms 856 KB Output is correct
15 Correct 1 ms 856 KB Output is correct
16 Correct 1 ms 856 KB Output is correct
17 Correct 1 ms 948 KB Output is correct
18 Correct 1 ms 856 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 9 ms 2656 KB Output is correct
23 Correct 9 ms 2652 KB Output is correct
24 Correct 11 ms 2648 KB Output is correct
25 Correct 2 ms 856 KB Output is correct
26 Correct 3 ms 856 KB Output is correct
27 Correct 3 ms 856 KB Output is correct
28 Correct 2 ms 856 KB Output is correct
29 Correct 3 ms 1112 KB Output is correct
30 Correct 2 ms 1112 KB Output is correct
31 Runtime error 5 ms 2136 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 856 KB Output is correct
14 Correct 1 ms 856 KB Output is correct
15 Correct 1 ms 856 KB Output is correct
16 Correct 1 ms 856 KB Output is correct
17 Correct 1 ms 948 KB Output is correct
18 Correct 1 ms 856 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 856 KB Output is correct
34 Correct 1 ms 856 KB Output is correct
35 Correct 1 ms 600 KB Output is correct
36 Correct 1 ms 856 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 600 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 1 ms 444 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 1 ms 604 KB Output is correct
49 Correct 1 ms 600 KB Output is correct
50 Correct 1 ms 860 KB Output is correct
51 Correct 1 ms 856 KB Output is correct
52 Correct 1 ms 856 KB Output is correct
53 Correct 1 ms 856 KB Output is correct
54 Correct 1 ms 856 KB Output is correct
55 Correct 1 ms 856 KB Output is correct
56 Correct 1 ms 600 KB Output is correct
57 Correct 2 ms 856 KB Output is correct
58 Correct 1 ms 600 KB Output is correct
59 Correct 1 ms 860 KB Output is correct
60 Correct 1 ms 604 KB Output is correct
61 Correct 1 ms 856 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 856 KB Output is correct
16 Correct 1 ms 856 KB Output is correct
17 Correct 1 ms 856 KB Output is correct
18 Correct 1 ms 856 KB Output is correct
19 Correct 1 ms 948 KB Output is correct
20 Correct 1 ms 856 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 9 ms 2656 KB Output is correct
25 Correct 9 ms 2652 KB Output is correct
26 Correct 11 ms 2648 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 856 KB Output is correct
37 Correct 1 ms 856 KB Output is correct
38 Correct 1 ms 600 KB Output is correct
39 Correct 1 ms 856 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 600 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 1 ms 444 KB Output is correct
50 Correct 1 ms 604 KB Output is correct
51 Correct 1 ms 604 KB Output is correct
52 Correct 1 ms 600 KB Output is correct
53 Correct 1 ms 860 KB Output is correct
54 Correct 1 ms 856 KB Output is correct
55 Correct 1 ms 856 KB Output is correct
56 Correct 1 ms 856 KB Output is correct
57 Correct 1 ms 856 KB Output is correct
58 Correct 1 ms 856 KB Output is correct
59 Correct 1 ms 600 KB Output is correct
60 Correct 2 ms 856 KB Output is correct
61 Correct 1 ms 600 KB Output is correct
62 Correct 1 ms 860 KB Output is correct
63 Correct 1 ms 604 KB Output is correct
64 Correct 1 ms 856 KB Output is correct
65 Correct 1 ms 600 KB Output is correct
66 Correct 1 ms 348 KB Output is correct
67 Correct 1 ms 600 KB Output is correct
68 Correct 1 ms 600 KB Output is correct
69 Correct 1 ms 600 KB Output is correct
70 Correct 2 ms 964 KB Output is correct
71 Correct 2 ms 856 KB Output is correct
72 Correct 2 ms 856 KB Output is correct
73 Correct 2 ms 600 KB Output is correct
74 Correct 2 ms 856 KB Output is correct
75 Correct 1 ms 856 KB Output is correct
76 Correct 10 ms 2420 KB Output is correct
77 Correct 10 ms 2516 KB Output is correct
78 Correct 12 ms 2904 KB Output is correct
79 Correct 1 ms 856 KB Output is correct
80 Correct 2 ms 856 KB Output is correct
81 Correct 1 ms 856 KB Output is correct
82 Correct 1 ms 856 KB Output is correct
83 Correct 1 ms 860 KB Output is correct
84 Correct 2 ms 1112 KB Output is correct
85 Correct 2 ms 1112 KB Output is correct
86 Correct 2 ms 1112 KB Output is correct
87 Correct 2 ms 1220 KB Output is correct
88 Correct 2 ms 1116 KB Output is correct
89 Correct 2 ms 1112 KB Output is correct
90 Correct 24 ms 3656 KB Output is correct
91 Correct 14 ms 3664 KB Output is correct
92 Correct 23 ms 3676 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 856 KB Output is correct
16 Correct 1 ms 856 KB Output is correct
17 Correct 1 ms 856 KB Output is correct
18 Correct 1 ms 856 KB Output is correct
19 Correct 1 ms 948 KB Output is correct
20 Correct 1 ms 856 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 9 ms 2656 KB Output is correct
25 Correct 9 ms 2652 KB Output is correct
26 Correct 11 ms 2648 KB Output is correct
27 Correct 2 ms 856 KB Output is correct
28 Correct 3 ms 856 KB Output is correct
29 Correct 3 ms 856 KB Output is correct
30 Correct 2 ms 856 KB Output is correct
31 Correct 3 ms 1112 KB Output is correct
32 Correct 2 ms 1112 KB Output is correct
33 Runtime error 5 ms 2136 KB Execution killed with signal 11
34 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 856 KB Output is correct
16 Correct 1 ms 856 KB Output is correct
17 Correct 1 ms 856 KB Output is correct
18 Correct 1 ms 856 KB Output is correct
19 Correct 1 ms 948 KB Output is correct
20 Correct 1 ms 856 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 9 ms 2656 KB Output is correct
25 Correct 9 ms 2652 KB Output is correct
26 Correct 11 ms 2648 KB Output is correct
27 Correct 2 ms 856 KB Output is correct
28 Correct 3 ms 856 KB Output is correct
29 Correct 3 ms 856 KB Output is correct
30 Correct 2 ms 856 KB Output is correct
31 Correct 3 ms 1112 KB Output is correct
32 Correct 2 ms 1112 KB Output is correct
33 Runtime error 5 ms 2136 KB Execution killed with signal 11
34 Halted 0 ms 0 KB -