This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
int minimumInstructions(
int N, int M, int K, std::vector<int> C,
std::vector<int> A, std::vector<std::vector<int>> B) {
vector<set<int>> mp(K);
for (int i = 0; i < M; ++i) for (int j : B[i]) mp[j].insert(i);
int cnt = 0, ptr = 0;
auto calc = [&](int x, int y) {
int l = y, r = y, tmp = x;
while (r - ptr < M - 1 && r < N - 1 && mp[C[r + 1]].count((tmp + 1) % M))
++r, tmp = tmp < M - 1 ? tmp + 1 : 0;
if (r - ptr + 1 == M) return r;
tmp = x;
while (r - l + 1 < M && l > 0 && mp[C[l - 1]].count((tmp + M - 1) % M))
--l, tmp = tmp ? tmp - 1 : M - 1;
return r - l + 1 == M ? r : -1;
};
while (ptr < N) {
int r = -1;
for (int i : mp[C[ptr]]) r = max(r, calc(i, ptr));
if (r == -1) return -1;
++cnt, ptr = r + 1;
}
return cnt;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |