Submission #397860

#TimeUsernameProblemLanguageResultExecution timeMemory
397860ZikXewenPainting Walls (APIO20_paint)C++17
51 / 100
1588 ms12980 KiB
#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
int minimumInstructions( int N, int M, int K, vector<int> C, vector<int> A, vector<vector<int>> B) {
	vector<vector<int>> f(K);
	vector<int> mem(M), an;
	for(int i = 0; i < M; ++i) for(int j: B[i]) f[j].emplace_back(i);
	for(int i = 0, ct = 0, tem; i < N; ++i) {
		if(i >= M) for(int j: f[C[i - M]]) if(--mem[j] == M - 1) --ct;
		for(int j: f[C[i]]) if(++mem[j] == M) ++ct;
		if(ct) an.emplace_back(i);
		tem = mem[M - 1];
		for(int i = M - 1; i; --i) mem[i] = mem[i - 1];
		mem[0] = tem;
	}
	if(an.empty() or upper_bound(an.begin(), an.end(), M - 1) == an.begin()) return -1;
	for(int i = -1, ct = 1, tem;; i = tem, ++ct){
		tem = *(upper_bound(an.begin(), an.end(), i + M) - 1);
		if(tem == N - 1) return ct;
		if(tem == i) return -1;
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...