제출 #387281

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
387281		talant117408	벽 칠하기 (APIO20_paint)	C++17	63 / 100	1225 ms	163804 KiB

paint

#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], can[MAXN], rightmost[20003][2003], L[MAXN], rightmost1[MAXN];
vector <int> isLiked[MAXN];

int g(int i) {
	if (i >= n) return 0;
	else if (i - L[i] >= m) return 1e9;
	return 1+g(L[i]+m);
}

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) {
		vector <int> which(n);
		for (int i = 0; i < n; i++) {
			if (sz(isLiked[color[i]]) == 0) return -1;
			which[i] = isLiked[color[i]].back();
		}
		for (int i = n-1; i >= 0; i--) {
			if (i == n-1 || which[i+1] != (which[i]+1)%m) {
				rightmost1[i] = i;
			}
			else {
				rightmost1[i] = rightmost1[i+1];
			}
		}
		for (int i = 0; i < n; i++) {
			can[i] = (rightmost1[i]-i >= m-1 ? 1 : 0);
		}
	}
	else {
		for (int i = n-1; i >= 0; i--) {
			for (int j = m-1; j >= 0; j--) {
				if (!binary_search(all(isLiked[color[i]]), j)) {
					rightmost[i][j] = -1e9;
				}
				else {
					if (i == n-1 || !binary_search(all(isLiked[color[i+1]]), (j+1)%m)) {
						rightmost[i][j] = i;
					}
					else {
						rightmost[i][j] = rightmost[i+1][(j+1)%m];
					}
				}
			}
		}
		
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				if (rightmost[i][j]-i >= m-1) {
					can[i] = 1;
				}
			}
		}
	}
	
	int prev = -1e9;
	for (int i = 0; i < n; i++) {
		if (can[i]) prev = i;
		L[i] = prev;
	}
	
	auto ans = g(0);
	return (ans >= 1e8 ? -1 : ans);
}

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

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