oj.uz

답안 #657357

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
657357 2022-11-09T17:50:43 Z 600Mihnea 벽 칠하기 (APIO20_paint) C++17
28 / 100
 1500 ms 162468 KB 
#include "paint.h"
#include <bits/stdc++.h>

using namespace std;

const int INF = (int) 1e9 + 7;

int minimumInstructions(int n, int m, int k, vector<int> cwant, vector<int> cntt_t_, vector<vector<int>> like) {
	vector<int> ok(n, 0);
	
	assert((int) like.size() == m);
	assert((int) cntt_t_.size() == m);
	
	for (int i = 0; i < m; i++) {
		assert((int) like[i].size() == cntt_t_[i]);
		sort(like[i].begin(), like[i].end());
	}
	
	vector<int> cnt(m, 0);
	
	
	function<int(int, int)> do_like = [&] (int i, int val) {
		int l = 0, r = (int) like[i].size() - 1;
		while (l <= r) {
			int m = (l + r) / 2;
			if (like[i][m] == val) {
				return 1;	
			}
			if (like[i][m] < val) {
				l = m + 1;
			} else {
				r = m - 1;
			}
		}
		return 0;
	};
	
	function<void(int, int)> add_position = [&] (int i, int sgn) {
		for (int z = 0; z < m; z++) {
			/*
			0 -> z
			1 -> (z + 1) % m
			i -> (z + i) % m 
			*/
			int guy = (z + i) % m;
			if (do_like(guy, cwant[i])) {
				cnt[z] += sgn;
			}
		}
	};
	
	for (int i = 0; i < m; i++) {
		add_position(i, +1);
	}
	
	
	
	/*
		ok[y][w] = 1 if wall y can be painted by worker w
		eu vreau ok[y][x] & ok[y + 1][(x + 1) % n] & ... & ok[y + m - 1][(x + m - 1) % n]
				dp[y][x] = longest cyclical thing starting here that works
	*/
	
	vector<bool> isok(n * m, 0);
	vector<int> best(n * m, 0);
	
	vector<bool> act(k, 0);
		
	for (int w = 0; w < m; w++) {
		for (auto &col : like[w]) {
			act[col] = 1;
		}
		for (int i = 0; i < n; i++) {
			if (act[cwant[i]]) {
				isok[i * m + w] = 1;
			}
		}
		for (auto &col : like[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 i = 0; i < m; i++) {
		ok[0] |= (cnt[i] == m);
	}
	for (int l = 1; l <= n - m; l++) {
		int r = l + m - 1;
		add_position(r, +1);
		add_position(l - 1, -1);
		for (int i = 0; i < m; i++) {
			ok[l] |= (cnt[i] == 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 3 ms 724 KB Output is correct
14 Correct 3 ms 724 KB Output is correct
15 Correct 3 ms 724 KB Output is correct
16 Correct 3 ms 692 KB Output is correct
17 Correct 4 ms 724 KB Output is correct
18 Correct 3 ms 688 KB Output is correct
19 Correct 4 ms 724 KB Output is correct
20 Correct 4 ms 724 KB Output is correct
21 Correct 4 ms 724 KB Output is correct
22 Correct 18 ms 2020 KB Output is correct
23 Correct 19 ms 2004 KB Output is correct
24 Correct 19 ms 2048 KB Output is correct
25 Correct 3 ms 800 KB Output is correct
26 Correct 3 ms 852 KB Output is correct
27 Correct 4 ms 852 KB Output is correct
28 Correct 5 ms 852 KB Output is correct
29 Correct 5 ms 828 KB Output is correct
30 Correct 6 ms 924 KB Output is correct
31 Execution timed out 1593 ms 162468 KB Time limit exceeded
32 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 3 ms 724 KB Output is correct
14 Correct 3 ms 724 KB Output is correct
15 Correct 3 ms 724 KB Output is correct
16 Correct 3 ms 692 KB Output is correct
17 Correct 4 ms 724 KB Output is correct
18 Correct 3 ms 688 KB Output is correct
19 Correct 4 ms 724 KB Output is correct
20 Correct 4 ms 724 KB Output is correct
21 Correct 4 ms 724 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 300 KB Output is correct
24 Correct 0 ms 256 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 296 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 300 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 596 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 2 ms 468 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 2 ms 468 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 2 ms 428 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 300 KB Output is correct
47 Correct 1 ms 300 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 4 ms 724 KB Output is correct
51 Correct 3 ms 724 KB Output is correct
52 Correct 4 ms 724 KB Output is correct
53 Correct 3 ms 724 KB Output is correct
54 Correct 3 ms 724 KB Output is correct
55 Correct 5 ms 684 KB Output is correct
56 Correct 4 ms 688 KB Output is correct
57 Correct 3 ms 684 KB Output is correct
58 Correct 4 ms 724 KB Output is correct
59 Correct 3 ms 672 KB Output is correct
60 Correct 4 ms 724 KB Output is correct
61 Correct 3 ms 724 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 3 ms 724 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 3 ms 724 KB Output is correct
18 Correct 3 ms 692 KB Output is correct
19 Correct 4 ms 724 KB Output is correct
20 Correct 3 ms 688 KB Output is correct
21 Correct 4 ms 724 KB Output is correct
22 Correct 4 ms 724 KB Output is correct
23 Correct 4 ms 724 KB Output is correct
24 Correct 18 ms 2020 KB Output is correct
25 Correct 19 ms 2004 KB Output is correct
26 Correct 19 ms 2048 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 296 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 300 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 2 ms 596 KB Output is correct
37 Correct 2 ms 596 KB Output is correct
38 Correct 2 ms 468 KB Output is correct
39 Correct 2 ms 468 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 2 ms 428 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 2 ms 468 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 300 KB Output is correct
50 Correct 1 ms 300 KB Output is correct
51 Correct 1 ms 384 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 4 ms 724 KB Output is correct
54 Correct 3 ms 724 KB Output is correct
55 Correct 4 ms 724 KB Output is correct
56 Correct 3 ms 724 KB Output is correct
57 Correct 3 ms 724 KB Output is correct
58 Correct 5 ms 684 KB Output is correct
59 Correct 4 ms 688 KB Output is correct
60 Correct 3 ms 684 KB Output is correct
61 Correct 4 ms 724 KB Output is correct
62 Correct 3 ms 672 KB Output is correct
63 Correct 4 ms 724 KB Output is correct
64 Correct 3 ms 724 KB Output is correct
65 Correct 2 ms 468 KB Output is correct
66 Correct 1 ms 304 KB Output is correct
67 Correct 2 ms 468 KB Output is correct
68 Correct 2 ms 468 KB Output is correct
69 Correct 2 ms 424 KB Output is correct
70 Correct 6 ms 724 KB Output is correct
71 Correct 6 ms 728 KB Output is correct
72 Correct 5 ms 564 KB Output is correct
73 Correct 2 ms 312 KB Output is correct
74 Correct 5 ms 596 KB Output is correct
75 Correct 4 ms 700 KB Output is correct
76 Correct 14 ms 1956 KB Output is correct
77 Correct 13 ms 1896 KB Output is correct
78 Correct 16 ms 2260 KB Output is correct
79 Correct 3 ms 724 KB Output is correct
80 Correct 3 ms 680 KB Output is correct
81 Correct 3 ms 724 KB Output is correct
82 Correct 3 ms 716 KB Output is correct
83 Correct 4 ms 724 KB Output is correct
84 Correct 8 ms 852 KB Output is correct
85 Correct 9 ms 944 KB Output is correct
86 Correct 9 ms 852 KB Output is correct
87 Correct 8 ms 948 KB Output is correct
88 Correct 8 ms 852 KB Output is correct
89 Correct 8 ms 944 KB Output is correct
90 Correct 25 ms 2748 KB Output is correct
91 Correct 26 ms 2808 KB Output is correct
92 Correct 26 ms 2844 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 3 ms 724 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 3 ms 724 KB Output is correct
18 Correct 3 ms 692 KB Output is correct
19 Correct 4 ms 724 KB Output is correct
20 Correct 3 ms 688 KB Output is correct
21 Correct 4 ms 724 KB Output is correct
22 Correct 4 ms 724 KB Output is correct
23 Correct 4 ms 724 KB Output is correct
24 Correct 18 ms 2020 KB Output is correct
25 Correct 19 ms 2004 KB Output is correct
26 Correct 19 ms 2048 KB Output is correct
27 Correct 3 ms 800 KB Output is correct
28 Correct 3 ms 852 KB Output is correct
29 Correct 4 ms 852 KB Output is correct
30 Correct 5 ms 852 KB Output is correct
31 Correct 5 ms 828 KB Output is correct
32 Correct 6 ms 924 KB Output is correct
33 Execution timed out 1593 ms 162468 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 3 ms 724 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 3 ms 724 KB Output is correct
18 Correct 3 ms 692 KB Output is correct
19 Correct 4 ms 724 KB Output is correct
20 Correct 3 ms 688 KB Output is correct
21 Correct 4 ms 724 KB Output is correct
22 Correct 4 ms 724 KB Output is correct
23 Correct 4 ms 724 KB Output is correct
24 Correct 18 ms 2020 KB Output is correct
25 Correct 19 ms 2004 KB Output is correct
26 Correct 19 ms 2048 KB Output is correct
27 Correct 3 ms 800 KB Output is correct
28 Correct 3 ms 852 KB Output is correct
29 Correct 4 ms 852 KB Output is correct
30 Correct 5 ms 852 KB Output is correct
31 Correct 5 ms 828 KB Output is correct
32 Correct 6 ms 924 KB Output is correct
33 Execution timed out 1593 ms 162468 KB Time limit exceeded
34 Halted 0 ms 0 KB -