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 <iostream>
#include <set>
#include <vector>
#include "paint.h"
using namespace std;
typedef vector<int> vi;
int minimumInstructions(int n, int m, int k, vi a, vi c, vector<vi> b) {
vector<vi> pos(k);
for (int i = 0; i < m; i++)
for (int x : b[i]) {
pos[x].push_back(i);
}
vi cnt(m), start(n);
for (int i = 0; i < n; i++) {
vector<pair<int, int>> v;
for (int j : pos[a[i]]) {
int j_ = (j - 1 + m) % m;
v.push_back({j, cnt[j_] + 1});
}
if (i > 0) {
for (int j : pos[a[i - 1]]) cnt[j] = 0;
}
for (auto [j, x] : v) {
if (x >= m) start[i - m + 1] = 1;
cnt[j] = x;
}
}
vi dp(n + 1, n + 1);
dp[0] = 0;
multiset<int> v;
for (int i = 0; i <= n; i++) {
if (v.size()) dp[i] = *v.begin() + 1;
if (start[i]) {
v.insert(dp[i]);
}
if (i >= m && start[i - m]) v.erase(v.find(dp[i - m]));
}
if (dp[n] > n) return -1;
return dp[n];
}
# | 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... |