Submission #1180946

#	Time	Username	Problem	Language	Result	Execution time	Memory
1180946		stdfloat	Painting Walls (APIO20_paint)	C++20	0 / 100	1 ms	328 KiB

paint

#include <bits/stdc++.h>
#include "paint.h"
// #include "grader.cpp"
using namespace std;

#define sz(x) (int)x.size()

int minimumInstructions(int n, int m, int K, vector<int> C, vector<int> A, vector<vector<int>> B) {
	vector<vector<int>> F(K);
	for (int i = 0; i < m; i++) {
		for (auto j : B[i])
			F[j].push_back(i);
	}

	vector<vector<int>> P(n + 1);
	for (int i = n - 1; i >= 0; i--) {
		P[i].assign(sz(F[C[i]]), i);

		int ind = 0;
		for (int j = 0; j < sz(F[C[i]]); j++) {
			while (ind < sz(F[C[i + 1]]) && F[C[i + 1]][ind] <= F[C[i]][j]) ind++;

			if (!F[C[i + 1]].empty() && F[C[i]][j] == m - 1 && !F[C[i + 1]][0]) P[i][j] = P[i + 1][0];
			if (ind != sz(F[C[i + 1]]) && F[C[i]][j] + 1 == F[C[i + 1]][ind]) P[i][j] = P[i + 1][ind];
		}
	}

	int r = INT_MIN, R = 0, cnt = 0;
	for (int i = 0; i < n; i++) {
		bool tr = false;
		for (int j = 0; j < sz(F[C[i]]); j++)
			tr |= (i + m - 1 <= P[i][j]);

		if (tr) r = i;

		if (R == i) {
			if (r + m <= R) return -1;

			cnt++;
			R = r + m;
		}
	}

	return cnt;
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 15
• Subtask 3: 0 / 13
• Subtask 4: 0 / 23
• Subtask 5: 0 / 37