oj.uz

Submission #387135

# Submission time Handle Problem Language Result Execution time Memory
387135 2021-04-08T03:30:11 Z milleniumEeee Painting Walls (APIO20_paint) C++17
12 / 100
 97 ms 12652 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)
using namespace std;

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

int pos[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(pos, -1, sizeof(pos));
	for (int i = 0; i < M; i++) {
		for (int el : B[i]) {
			pos[el] = i;
		}
	}
	for (int i = 0; i < N; i++) {
		if (pos[C[i]] == -1) {
			return -1;
		}
	}
	auto nxt = [&](int p) {
		if (p + 1 < M) {
			return p + 1;
		} else {
			return 0;
		}
	};
	for (int i = 0; i + 1 < N; i++) {
		int before = (i > 0 ? pref[i - 1] : 0);
		pref[i] = before + (pos[C[i + 1]] == nxt(pos[C[i]]));
	}
	auto get = [&](int l, int r) {
		return pref[r - 1] - pref[l - 1];
	};
	auto can = [&](int l, int r) {
		if (r - l + 1 == M && get(l, r) == M - 1) {
			return true;
		} else {
			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
*/

Compilation message

paint.cpp: In function 'int minimumInstructions(int, int, int, std::vector<int>, std::vector<int>, std::vector<std::vector<int> >)':
paint.cpp:85:34: warning: array subscript -1 is below array bounds of 'int [100005]' [-Warray-bounds]
   85 |   return pref[r - 1] - pref[l - 1];
      |                        ~~~~~~~~~~^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1132 KB Output is correct
2 Correct 1 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 1 ms 1132 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 2 ms 1132 KB Output is correct
14 Correct 2 ms 1132 KB Output is correct
15 Correct 2 ms 1132 KB Output is correct
16 Correct 2 ms 1132 KB Output is correct
17 Correct 2 ms 1132 KB Output is correct
18 Correct 2 ms 1132 KB Output is correct
19 Correct 1 ms 748 KB Output is correct
20 Correct 2 ms 748 KB Output is correct
21 Correct 1 ms 748 KB Output is correct
22 Correct 17 ms 1900 KB Output is correct
23 Correct 16 ms 1900 KB Output is correct
24 Correct 15 ms 1900 KB Output is correct
25 Correct 12 ms 2028 KB Output is correct
26 Correct 12 ms 1900 KB Output is correct
27 Correct 9 ms 1900 KB Output is correct
28 Correct 5 ms 1900 KB Output is correct
29 Correct 4 ms 1900 KB Output is correct
30 Correct 4 ms 1900 KB Output is correct
31 Correct 23 ms 2284 KB Output is correct
32 Correct 21 ms 2284 KB Output is correct
33 Correct 21 ms 2284 KB Output is correct
34 Correct 21 ms 2304 KB Output is correct
35 Correct 21 ms 2284 KB Output is correct
36 Correct 21 ms 2284 KB Output is correct
37 Correct 19 ms 2924 KB Output is correct
38 Correct 19 ms 2924 KB Output is correct
39 Correct 19 ms 2924 KB Output is correct
40 Correct 58 ms 4972 KB Output is correct
41 Correct 34 ms 3564 KB Output is correct
42 Correct 40 ms 5356 KB Output is correct
43 Correct 16 ms 3948 KB Output is correct
44 Correct 13 ms 3692 KB Output is correct
45 Correct 19 ms 5356 KB Output is correct
46 Correct 87 ms 10476 KB Output is correct
47 Correct 62 ms 7068 KB Output is correct
48 Correct 39 ms 9580 KB Output is correct
49 Correct 35 ms 9196 KB Output is correct
50 Correct 35 ms 9068 KB Output is correct
51 Correct 30 ms 7404 KB Output is correct
52 Correct 60 ms 5612 KB Output is correct
53 Correct 73 ms 5612 KB Output is correct
54 Correct 41 ms 5740 KB Output is correct
55 Correct 21 ms 5612 KB Output is correct
56 Correct 15 ms 5612 KB Output is correct
57 Correct 16 ms 5572 KB Output is correct
58 Correct 93 ms 12652 KB Output is correct
59 Correct 97 ms 12652 KB Output is correct
60 Correct 93 ms 12552 KB Output is correct
61 Correct 92 ms 12524 KB Output is correct
62 Correct 91 ms 12524 KB Output is correct
63 Correct 92 ms 12524 KB Output is correct
64 Correct 45 ms 11756 KB Output is correct
65 Correct 44 ms 11756 KB Output is correct
66 Correct 44 ms 11756 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 37.0

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