oj.uz

Submission #387140

# Submission time Handle Problem Language Result Execution time Memory
387140 2021-04-08T03:41:57 Z milleniumEeee Painting Walls (APIO20_paint) C++17
28 / 100
 1500 ms 2796 KB 
#include <bits/stdc++.h>
#include "paint.h"
//#include "grader.cpp"
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
#define all(s) s.begin(), s.end()
#define szof(s) (int)s.size()
using namespace std;

const int MAXN = (int)1e5 + 5;
const int INF = 1e9 + 7;

int exist[MAXN];
int dp[MAXN];
int pref[MAXN];

struct Segment_Tree {
	vector <int> tree;
	vector <int> lazy;
	Segment_Tree (int n) {
		tree.resize(n * 4, INF);
		lazy.resize(n * 4, INF);
	}
	void push(int v, int tl, int tr) {
		if (lazy[v] == INF) {
			return;
		}
		if (tl != tr) {
			chkmin(lazy[v + v], lazy[v]);
			chkmin(lazy[v + v + 1], lazy[v]);
		}
		chkmin(tree[v], lazy[v]);
		lazy[v] = INF;
	}
	void upd(int l, int r, int val, int v, int tl, int tr) {
		push(v, tl, tr);
		if (l > tr || tl > r) {
			return;
		}
		if (l <= tl && tr <= r) {
			lazy[v] = val;
			push(v, tl, tr);
			return;
		}
		int mid = (tl + tr) >> 1;
		upd(l, r, val, v + v, tl, mid);
		upd(l, r, val, v + v + 1, mid + 1, tr);
		tree[v] = min(tree[v + v], tree[v + v + 1]);
	}
	int get(int l, int r, int v, int tl, int tr) {
		push(v, tl, tr);
		if (l > tr || tl > r) {
			return INF;
		}
		if (l <= tl && tr <= r) {
			return tree[v];
		}
		int mid = (tl + tr) >> 1;
		return min(get(l, r, v + v, tl, mid), get(l, r, v + v + 1, mid + 1, tr));
	}
};

int minimumInstructions(int N, int M, int K, vector<int> C, vector<int> A, vector<vector<int>> B) {
	memset(exist, -1, sizeof(exist));
	for (int i = 0; i < M; i++) {
		sort(all(B[i]));
		for (int el : B[i]) {
			exist[el] = i;
		}
	}
	for (int i = 0; i < N; i++) {
		if (exist[C[i]] == -1) {
			return -1;
		}
	}
	auto nxt = [&](int p) {
		if (p + 1 < M) {
			return p + 1;
		} else {
			return 0;
		}
	};
	auto can = [&](int l, int r) {
		for (int x = 0; x < M; x++) {
			bool ok = 1;
			int step = 0;
			int pos = x;
			while (1) {
				ok &= (binary_search(all(B[pos]), C[l + step]));
				step++;
				pos = nxt(pos);
				if (step == M) {
					break;
				}
			}
			if (ok) {
				return true;
			}
		}
		return false;
	};
	fill(dp, dp + MAXN, INF);
	Segment_Tree T(N);
	if (can(0, M - 1)) {
		T.upd(0, M - 1, 1, 1, 0, N - 1);
	}
	for (int i = M; i < N; i++) {
		if (can(i - M + 1, i)) {
			int best = T.get(i - M, i - 1, 1, 0, N - 1);
			T.upd(i - M + 1, i, best + 1, 1, 0, N - 1);
		}
	}
	if (T.get(N - 1, N - 1, 1, 0, N - 1) < INF) {
		return T.get(N - 1, N - 1, 1, 0, N - 1);
	} else {
		return -1;
	}
}

/*
5 3 10
0 2 1 4 3
2 0 4
2 3 2
1 1
*/

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1132 KB Output is correct
2 Correct 2 ms 1132 KB Output is correct
3 Correct 1 ms 748 KB Output is correct
4 Correct 2 ms 1132 KB Output is correct
5 Correct 2 ms 1132 KB Output is correct
6 Correct 2 ms 1148 KB Output is correct
7 Correct 2 ms 1132 KB Output is correct
8 Correct 2 ms 1132 KB Output is correct
9 Correct 2 ms 1132 KB Output is correct
10 Correct 2 ms 1132 KB Output is correct
11 Correct 2 ms 1132 KB Output is correct
12 Correct 2 ms 1132 KB Output is correct
13 Correct 85 ms 1132 KB Output is correct
14 Correct 89 ms 1260 KB Output is correct
15 Correct 93 ms 1260 KB Output is correct
16 Correct 92 ms 1208 KB Output is correct
17 Correct 94 ms 1132 KB Output is correct
18 Correct 93 ms 1132 KB Output is correct
19 Correct 2 ms 748 KB Output is correct
20 Correct 2 ms 748 KB Output is correct
21 Correct 2 ms 748 KB Output is correct
22 Correct 994 ms 2668 KB Output is correct
23 Correct 971 ms 2540 KB Output is correct
24 Correct 946 ms 2668 KB Output is correct
25 Correct 12 ms 2048 KB Output is correct
26 Correct 12 ms 1900 KB Output is correct
27 Correct 9 ms 1900 KB Output is correct
28 Correct 8 ms 1900 KB Output is correct
29 Correct 6 ms 1900 KB Output is correct
30 Correct 7 ms 1900 KB Output is correct
31 Execution timed out 1531 ms 2556 KB Time limit exceeded
32 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1132 KB Output is correct
2 Correct 2 ms 1132 KB Output is correct
3 Correct 1 ms 748 KB Output is correct
4 Correct 2 ms 1132 KB Output is correct
5 Correct 2 ms 1132 KB Output is correct
6 Correct 2 ms 1148 KB Output is correct
7 Correct 2 ms 1132 KB Output is correct
8 Correct 2 ms 1132 KB Output is correct
9 Correct 2 ms 1132 KB Output is correct
10 Correct 2 ms 1132 KB Output is correct
11 Correct 2 ms 1132 KB Output is correct
12 Correct 2 ms 1132 KB Output is correct
13 Correct 85 ms 1132 KB Output is correct
14 Correct 89 ms 1260 KB Output is correct
15 Correct 93 ms 1260 KB Output is correct
16 Correct 92 ms 1208 KB Output is correct
17 Correct 94 ms 1132 KB Output is correct
18 Correct 93 ms 1132 KB Output is correct
19 Correct 2 ms 748 KB Output is correct
20 Correct 2 ms 748 KB Output is correct
21 Correct 2 ms 748 KB Output is correct
22 Correct 2 ms 1132 KB Output is correct
23 Correct 2 ms 1132 KB Output is correct
24 Correct 2 ms 1132 KB Output is correct
25 Correct 1 ms 748 KB Output is correct
26 Correct 2 ms 1132 KB Output is correct
27 Correct 2 ms 1132 KB Output is correct
28 Correct 2 ms 1132 KB Output is correct
29 Correct 3 ms 1132 KB Output is correct
30 Correct 4 ms 1132 KB Output is correct
31 Correct 2 ms 1132 KB Output is correct
32 Correct 7 ms 1132 KB Output is correct
33 Correct 41 ms 1132 KB Output is correct
34 Correct 50 ms 1132 KB Output is correct
35 Correct 19 ms 1132 KB Output is correct
36 Correct 35 ms 1132 KB Output is correct
37 Correct 31 ms 1132 KB Output is correct
38 Correct 1 ms 748 KB Output is correct
39 Correct 2 ms 1132 KB Output is correct
40 Correct 2 ms 748 KB Output is correct
41 Correct 28 ms 1132 KB Output is correct
42 Correct 1 ms 748 KB Output is correct
43 Correct 13 ms 1132 KB Output is correct
44 Correct 2 ms 1132 KB Output is correct
45 Correct 2 ms 1132 KB Output is correct
46 Correct 8 ms 1132 KB Output is correct
47 Correct 12 ms 1132 KB Output is correct
48 Correct 14 ms 1260 KB Output is correct
49 Correct 18 ms 1260 KB Output is correct
50 Correct 115 ms 1276 KB Output is correct
51 Correct 96 ms 1132 KB Output is correct
52 Correct 79 ms 1132 KB Output is correct
53 Correct 96 ms 1132 KB Output is correct
54 Correct 85 ms 1132 KB Output is correct
55 Correct 81 ms 1260 KB Output is correct
56 Correct 1 ms 748 KB Output is correct
57 Correct 87 ms 1132 KB Output is correct
58 Correct 2 ms 748 KB Output is correct
59 Correct 90 ms 1132 KB Output is correct
60 Correct 1 ms 748 KB Output is correct
61 Correct 99 ms 1260 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1132 KB Output is correct
2 Correct 2 ms 1132 KB Output is correct
3 Correct 2 ms 1132 KB Output is correct
4 Correct 2 ms 1132 KB Output is correct
5 Correct 1 ms 748 KB Output is correct
6 Correct 2 ms 1132 KB Output is correct
7 Correct 2 ms 1132 KB Output is correct
8 Correct 2 ms 1148 KB Output is correct
9 Correct 2 ms 1132 KB Output is correct
10 Correct 2 ms 1132 KB Output is correct
11 Correct 2 ms 1132 KB Output is correct
12 Correct 2 ms 1132 KB Output is correct
13 Correct 2 ms 1132 KB Output is correct
14 Correct 2 ms 1132 KB Output is correct
15 Correct 85 ms 1132 KB Output is correct
16 Correct 89 ms 1260 KB Output is correct
17 Correct 93 ms 1260 KB Output is correct
18 Correct 92 ms 1208 KB Output is correct
19 Correct 94 ms 1132 KB Output is correct
20 Correct 93 ms 1132 KB Output is correct
21 Correct 2 ms 748 KB Output is correct
22 Correct 2 ms 748 KB Output is correct
23 Correct 2 ms 748 KB Output is correct
24 Correct 994 ms 2668 KB Output is correct
25 Correct 971 ms 2540 KB Output is correct
26 Correct 946 ms 2668 KB Output is correct
27 Correct 2 ms 1132 KB Output is correct
28 Correct 1 ms 748 KB Output is correct
29 Correct 2 ms 1132 KB Output is correct
30 Correct 2 ms 1132 KB Output is correct
31 Correct 2 ms 1132 KB Output is correct
32 Correct 3 ms 1132 KB Output is correct
33 Correct 4 ms 1132 KB Output is correct
34 Correct 2 ms 1132 KB Output is correct
35 Correct 7 ms 1132 KB Output is correct
36 Correct 41 ms 1132 KB Output is correct
37 Correct 50 ms 1132 KB Output is correct
38 Correct 19 ms 1132 KB Output is correct
39 Correct 35 ms 1132 KB Output is correct
40 Correct 31 ms 1132 KB Output is correct
41 Correct 1 ms 748 KB Output is correct
42 Correct 2 ms 1132 KB Output is correct
43 Correct 2 ms 748 KB Output is correct
44 Correct 28 ms 1132 KB Output is correct
45 Correct 1 ms 748 KB Output is correct
46 Correct 13 ms 1132 KB Output is correct
47 Correct 2 ms 1132 KB Output is correct
48 Correct 2 ms 1132 KB Output is correct
49 Correct 8 ms 1132 KB Output is correct
50 Correct 12 ms 1132 KB Output is correct
51 Correct 14 ms 1260 KB Output is correct
52 Correct 18 ms 1260 KB Output is correct
53 Correct 115 ms 1276 KB Output is correct
54 Correct 96 ms 1132 KB Output is correct
55 Correct 79 ms 1132 KB Output is correct
56 Correct 96 ms 1132 KB Output is correct
57 Correct 85 ms 1132 KB Output is correct
58 Correct 81 ms 1260 KB Output is correct
59 Correct 1 ms 748 KB Output is correct
60 Correct 87 ms 1132 KB Output is correct
61 Correct 2 ms 748 KB Output is correct
62 Correct 90 ms 1132 KB Output is correct
63 Correct 1 ms 748 KB Output is correct
64 Correct 99 ms 1260 KB Output is correct
65 Correct 2 ms 1132 KB Output is correct
66 Correct 2 ms 1132 KB Output is correct
67 Correct 2 ms 1132 KB Output is correct
68 Correct 2 ms 1132 KB Output is correct
69 Correct 2 ms 1132 KB Output is correct
70 Correct 89 ms 1260 KB Output is correct
71 Correct 47 ms 1260 KB Output is correct
72 Correct 10 ms 1260 KB Output is correct
73 Correct 3 ms 1260 KB Output is correct
74 Correct 13 ms 1388 KB Output is correct
75 Correct 62 ms 1388 KB Output is correct
76 Correct 17 ms 2284 KB Output is correct
77 Correct 21 ms 2412 KB Output is correct
78 Correct 28 ms 2668 KB Output is correct
79 Correct 3 ms 1132 KB Output is correct
80 Correct 2 ms 1132 KB Output is correct
81 Correct 2 ms 1132 KB Output is correct
82 Correct 2 ms 1132 KB Output is correct
83 Correct 2 ms 1132 KB Output is correct
84 Correct 76 ms 1388 KB Output is correct
85 Correct 116 ms 1388 KB Output is correct
86 Correct 98 ms 1260 KB Output is correct
87 Correct 93 ms 1388 KB Output is correct
88 Correct 62 ms 1260 KB Output is correct
89 Correct 88 ms 1260 KB Output is correct
90 Correct 24 ms 2796 KB Output is correct
91 Correct 24 ms 2796 KB Output is correct
92 Correct 29 ms 2796 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1132 KB Output is correct
2 Correct 2 ms 1132 KB Output is correct
3 Correct 2 ms 1132 KB Output is correct
4 Correct 2 ms 1132 KB Output is correct
5 Correct 1 ms 748 KB Output is correct
6 Correct 2 ms 1132 KB Output is correct
7 Correct 2 ms 1132 KB Output is correct
8 Correct 2 ms 1148 KB Output is correct
9 Correct 2 ms 1132 KB Output is correct
10 Correct 2 ms 1132 KB Output is correct
11 Correct 2 ms 1132 KB Output is correct
12 Correct 2 ms 1132 KB Output is correct
13 Correct 2 ms 1132 KB Output is correct
14 Correct 2 ms 1132 KB Output is correct
15 Correct 85 ms 1132 KB Output is correct
16 Correct 89 ms 1260 KB Output is correct
17 Correct 93 ms 1260 KB Output is correct
18 Correct 92 ms 1208 KB Output is correct
19 Correct 94 ms 1132 KB Output is correct
20 Correct 93 ms 1132 KB Output is correct
21 Correct 2 ms 748 KB Output is correct
22 Correct 2 ms 748 KB Output is correct
23 Correct 2 ms 748 KB Output is correct
24 Correct 994 ms 2668 KB Output is correct
25 Correct 971 ms 2540 KB Output is correct
26 Correct 946 ms 2668 KB Output is correct
27 Correct 12 ms 2048 KB Output is correct
28 Correct 12 ms 1900 KB Output is correct
29 Correct 9 ms 1900 KB Output is correct
30 Correct 8 ms 1900 KB Output is correct
31 Correct 6 ms 1900 KB Output is correct
32 Correct 7 ms 1900 KB Output is correct
33 Execution timed out 1531 ms 2556 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1132 KB Output is correct
2 Correct 2 ms 1132 KB Output is correct
3 Correct 2 ms 1132 KB Output is correct
4 Correct 2 ms 1132 KB Output is correct
5 Correct 1 ms 748 KB Output is correct
6 Correct 2 ms 1132 KB Output is correct
7 Correct 2 ms 1132 KB Output is correct
8 Correct 2 ms 1148 KB Output is correct
9 Correct 2 ms 1132 KB Output is correct
10 Correct 2 ms 1132 KB Output is correct
11 Correct 2 ms 1132 KB Output is correct
12 Correct 2 ms 1132 KB Output is correct
13 Correct 2 ms 1132 KB Output is correct
14 Correct 2 ms 1132 KB Output is correct
15 Correct 85 ms 1132 KB Output is correct
16 Correct 89 ms 1260 KB Output is correct
17 Correct 93 ms 1260 KB Output is correct
18 Correct 92 ms 1208 KB Output is correct
19 Correct 94 ms 1132 KB Output is correct
20 Correct 93 ms 1132 KB Output is correct
21 Correct 2 ms 748 KB Output is correct
22 Correct 2 ms 748 KB Output is correct
23 Correct 2 ms 748 KB Output is correct
24 Correct 994 ms 2668 KB Output is correct
25 Correct 971 ms 2540 KB Output is correct
26 Correct 946 ms 2668 KB Output is correct
27 Correct 12 ms 2048 KB Output is correct
28 Correct 12 ms 1900 KB Output is correct
29 Correct 9 ms 1900 KB Output is correct
30 Correct 8 ms 1900 KB Output is correct
31 Correct 6 ms 1900 KB Output is correct
32 Correct 7 ms 1900 KB Output is correct
33 Execution timed out 1531 ms 2556 KB Time limit exceeded
34 Halted 0 ms 0 KB -