oj.uz

Submission #387143

# Submission time Handle Problem Language Result Execution time Memory
387143 2021-04-08T04:01:12 Z talant117408 Painting Walls (APIO20_paint) C++17
28 / 100
 1500 ms 7660 KB 
#include "paint.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

#define sz(v) (int)v.size()
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()

const int MAXN = 1e5+7;
int n, m, k;
int color[MAXN];
vector <int> isLiked[MAXN];

int minimumInstructions(int N, int M, int K, vector<int> C, vector<int> A, vector<vector<int>> B) {
	n = N; m = M; k = K;
	for (int i = 0; i < n; i++) color[i] = C[i];
	for (int i = 0; i < m; i++) {
		for (auto to : B[i]) {
			isLiked[to].pb(i);
		}
	}
	int fk = 0;
	for (int i = 0; i < k; i++) {
		fk = max(fk, sz(isLiked[i]));
	}
	
	/*if (fk < 2) {
		for (int i = 0; i+m < n; i++) {
			if (color[i] != color[i+m]) return -1;
		}
		if (sz(isLiked[color[0]]) == 0) {
			return -1;
		}
		else {
			int start = isLiked[color[0]].back();
			for (int i = 0; i < m; i++) {
				if (sz(isLiked[color[i]]) == 0 || isLiked[color[i]].back() != (start+i)%m) {
					return -1;
				}
			}	
		}
		return (n+m-1)/m;
	}
	else {*/
		vector <int> pos;
		for (int start = 0; start < m; start++) {
			int bad = 0;
			for (int i = 0; i < n; i++) {
				if (!binary_search(all(isLiked[color[i]]), (start+i)%m)) {
					bad++;
				}
				if (i >= m) {
					if (!binary_search(all(isLiked[color[i-m]]), (start+i-m)%m)) {
						bad--;
					}
				}
				if (i >= m-1 && bad == 0) {
					pos.pb(i-m+1);
				}
			}
		}
		sort(all(pos));
		if (sz(pos) == 0) return -1;
		vector <int> v;
		for (int i = 0; i < sz(pos); i++) {
			if (sz(v) == 0 || (sz(v) == 1 && v.back() != pos[i])) {
				v.pb(pos[i]);
			}
			else if (v[sz(v)-2]+m >= pos[i]) {
				v.pop_back();
				v.pb(pos[i]);
			}
			else if (v.back() != pos[i]) {
				v.pb(pos[i]);
			}
		}
		int flag = 1, cnt = 0;
		vector <int> pref(n), have(n);
		for (auto to : pos) {
			pref[to]++;
			if (to + m < n) pref[to+m]--;
		}
		for (int i = 0; i < n; i++) {
			cnt += pref[i];
			if (cnt) have[i] = 1;
		}
		for (int i = 0; i < n; i++) {
			if (!have[i]) flag = 0;
		}
		if (flag == 0) return -1;
		return sz(v);
//	}
	
	return 0;
}

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

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 3 ms 2668 KB Output is correct
3 Correct 3 ms 2668 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 3 ms 2684 KB Output is correct
6 Correct 3 ms 2668 KB Output is correct
7 Correct 3 ms 2668 KB Output is correct
8 Correct 3 ms 2668 KB Output is correct
9 Correct 3 ms 2668 KB Output is correct
10 Correct 3 ms 2668 KB Output is correct
11 Correct 3 ms 2668 KB Output is correct
12 Correct 3 ms 2668 KB Output is correct
13 Correct 4 ms 2668 KB Output is correct
14 Correct 4 ms 2668 KB Output is correct
15 Correct 4 ms 2668 KB Output is correct
16 Correct 4 ms 2668 KB Output is correct
17 Correct 4 ms 2668 KB Output is correct
18 Correct 4 ms 2668 KB Output is correct
19 Correct 4 ms 2668 KB Output is correct
20 Correct 6 ms 2668 KB Output is correct
21 Correct 4 ms 2668 KB Output is correct
22 Correct 33 ms 6636 KB Output is correct
23 Correct 28 ms 6636 KB Output is correct
24 Correct 27 ms 6636 KB Output is correct
25 Correct 6 ms 3180 KB Output is correct
26 Correct 8 ms 3180 KB Output is correct
27 Correct 8 ms 3180 KB Output is correct
28 Correct 6 ms 3072 KB Output is correct
29 Correct 7 ms 3052 KB Output is correct
30 Correct 7 ms 3052 KB Output is correct
31 Correct 977 ms 4136 KB Output is correct
32 Correct 1006 ms 4460 KB Output is correct
33 Correct 992 ms 4332 KB Output is correct
34 Correct 998 ms 4332 KB Output is correct
35 Correct 1024 ms 4332 KB Output is correct
36 Correct 1036 ms 4396 KB Output is correct
37 Execution timed out 1593 ms 7660 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 3 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 3 ms 2668 KB Output is correct
5 Correct 3 ms 2668 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 3 ms 2684 KB Output is correct
8 Correct 3 ms 2668 KB Output is correct
9 Correct 3 ms 2668 KB Output is correct
10 Correct 3 ms 2668 KB Output is correct
11 Correct 3 ms 2668 KB Output is correct
12 Correct 3 ms 2668 KB Output is correct
13 Correct 3 ms 2668 KB Output is correct
14 Correct 3 ms 2668 KB Output is correct
15 Correct 4 ms 2668 KB Output is correct
16 Correct 4 ms 2668 KB Output is correct
17 Correct 4 ms 2668 KB Output is correct
18 Correct 4 ms 2668 KB Output is correct
19 Correct 4 ms 2668 KB Output is correct
20 Correct 4 ms 2668 KB Output is correct
21 Correct 4 ms 2668 KB Output is correct
22 Correct 6 ms 2668 KB Output is correct
23 Correct 4 ms 2668 KB Output is correct
24 Correct 33 ms 6636 KB Output is correct
25 Correct 28 ms 6636 KB Output is correct
26 Correct 27 ms 6636 KB Output is correct
27 Correct 3 ms 2668 KB Output is correct
28 Correct 3 ms 2668 KB Output is correct
29 Correct 2 ms 2668 KB Output is correct
30 Correct 3 ms 2668 KB Output is correct
31 Correct 3 ms 2796 KB Output is correct
32 Correct 3 ms 2668 KB Output is correct
33 Correct 4 ms 2668 KB Output is correct
34 Correct 3 ms 2668 KB Output is correct
35 Correct 3 ms 2668 KB Output is correct
36 Correct 4 ms 2668 KB Output is correct
37 Correct 4 ms 2668 KB Output is correct
38 Correct 3 ms 2668 KB Output is correct
39 Correct 3 ms 2688 KB Output is correct
40 Correct 3 ms 2668 KB Output is correct
41 Correct 3 ms 2668 KB Output is correct
42 Correct 3 ms 2668 KB Output is correct
43 Correct 5 ms 2668 KB Output is correct
44 Correct 3 ms 2668 KB Output is correct
45 Correct 3 ms 2668 KB Output is correct
46 Correct 3 ms 2668 KB Output is correct
47 Correct 3 ms 2668 KB Output is correct
48 Correct 4 ms 2796 KB Output is correct
49 Correct 4 ms 2668 KB Output is correct
50 Correct 5 ms 2668 KB Output is correct
51 Correct 4 ms 2668 KB Output is correct
52 Correct 4 ms 2668 KB Output is correct
53 Correct 4 ms 2668 KB Output is correct
54 Correct 4 ms 2668 KB Output is correct
55 Correct 4 ms 2668 KB Output is correct
56 Correct 4 ms 2668 KB Output is correct
57 Correct 4 ms 2668 KB Output is correct
58 Correct 4 ms 2668 KB Output is correct
59 Correct 4 ms 2668 KB Output is correct
60 Correct 5 ms 2668 KB Output is correct
61 Correct 4 ms 2668 KB Output is correct
62 Correct 5 ms 2668 KB Output is correct
63 Correct 4 ms 2668 KB Output is correct
64 Correct 5 ms 2668 KB Output is correct
65 Correct 5 ms 2796 KB Output is correct
66 Correct 4 ms 2924 KB Output is correct
67 Correct 7 ms 3052 KB Output is correct
68 Correct 5 ms 2924 KB Output is correct
69 Correct 7 ms 3052 KB Output is correct
70 Correct 7 ms 2796 KB Output is correct
71 Correct 9 ms 2924 KB Output is correct
72 Correct 6 ms 2924 KB Output is correct
73 Correct 4 ms 2796 KB Output is correct
74 Correct 6 ms 2924 KB Output is correct
75 Correct 6 ms 2796 KB Output is correct
76 Correct 30 ms 5356 KB Output is correct
77 Correct 25 ms 5740 KB Output is correct
78 Correct 34 ms 6124 KB Output is correct
79 Correct 10 ms 3200 KB Output is correct
80 Correct 10 ms 3052 KB Output is correct
81 Correct 10 ms 3052 KB Output is correct
82 Correct 10 ms 3052 KB Output is correct
83 Correct 10 ms 3052 KB Output is correct
84 Correct 9 ms 2924 KB Output is correct
85 Correct 9 ms 2924 KB Output is correct
86 Correct 9 ms 2924 KB Output is correct
87 Correct 9 ms 2924 KB Output is correct
88 Correct 9 ms 2924 KB Output is correct
89 Correct 8 ms 2924 KB Output is correct
90 Correct 44 ms 6508 KB Output is correct
91 Correct 44 ms 6380 KB Output is correct
92 Correct 42 ms 6380 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 3 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 3 ms 2668 KB Output is correct
5 Correct 3 ms 2668 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 3 ms 2684 KB Output is correct
8 Correct 3 ms 2668 KB Output is correct
9 Correct 3 ms 2668 KB Output is correct
10 Correct 3 ms 2668 KB Output is correct
11 Correct 3 ms 2668 KB Output is correct
12 Correct 3 ms 2668 KB Output is correct
13 Correct 3 ms 2668 KB Output is correct
14 Correct 3 ms 2668 KB Output is correct
15 Correct 4 ms 2668 KB Output is correct
16 Correct 4 ms 2668 KB Output is correct
17 Correct 4 ms 2668 KB Output is correct
18 Correct 4 ms 2668 KB Output is correct
19 Correct 4 ms 2668 KB Output is correct
20 Correct 4 ms 2668 KB Output is correct
21 Correct 4 ms 2668 KB Output is correct
22 Correct 6 ms 2668 KB Output is correct
23 Correct 4 ms 2668 KB Output is correct
24 Correct 33 ms 6636 KB Output is correct
25 Correct 28 ms 6636 KB Output is correct
26 Correct 27 ms 6636 KB Output is correct
27 Correct 6 ms 3180 KB Output is correct
28 Correct 8 ms 3180 KB Output is correct
29 Correct 8 ms 3180 KB Output is correct
30 Correct 6 ms 3072 KB Output is correct
31 Correct 7 ms 3052 KB Output is correct
32 Correct 7 ms 3052 KB Output is correct
33 Correct 977 ms 4136 KB Output is correct
34 Correct 1006 ms 4460 KB Output is correct
35 Correct 992 ms 4332 KB Output is correct
36 Correct 998 ms 4332 KB Output is correct
37 Correct 1024 ms 4332 KB Output is correct
38 Correct 1036 ms 4396 KB Output is correct
39 Execution timed out 1593 ms 7660 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 3 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 3 ms 2668 KB Output is correct
5 Correct 3 ms 2668 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 3 ms 2684 KB Output is correct
8 Correct 3 ms 2668 KB Output is correct
9 Correct 3 ms 2668 KB Output is correct
10 Correct 3 ms 2668 KB Output is correct
11 Correct 3 ms 2668 KB Output is correct
12 Correct 3 ms 2668 KB Output is correct
13 Correct 3 ms 2668 KB Output is correct
14 Correct 3 ms 2668 KB Output is correct
15 Correct 4 ms 2668 KB Output is correct
16 Correct 4 ms 2668 KB Output is correct
17 Correct 4 ms 2668 KB Output is correct
18 Correct 4 ms 2668 KB Output is correct
19 Correct 4 ms 2668 KB Output is correct
20 Correct 4 ms 2668 KB Output is correct
21 Correct 4 ms 2668 KB Output is correct
22 Correct 6 ms 2668 KB Output is correct
23 Correct 4 ms 2668 KB Output is correct
24 Correct 33 ms 6636 KB Output is correct
25 Correct 28 ms 6636 KB Output is correct
26 Correct 27 ms 6636 KB Output is correct
27 Correct 6 ms 3180 KB Output is correct
28 Correct 8 ms 3180 KB Output is correct
29 Correct 8 ms 3180 KB Output is correct
30 Correct 6 ms 3072 KB Output is correct
31 Correct 7 ms 3052 KB Output is correct
32 Correct 7 ms 3052 KB Output is correct
33 Correct 977 ms 4136 KB Output is correct
34 Correct 1006 ms 4460 KB Output is correct
35 Correct 992 ms 4332 KB Output is correct
36 Correct 998 ms 4332 KB Output is correct
37 Correct 1024 ms 4332 KB Output is correct
38 Correct 1036 ms 4396 KB Output is correct
39 Execution timed out 1593 ms 7660 KB Time limit exceeded
40 Halted 0 ms 0 KB -