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;
vector<int> f[100005];
/*bool poss[100005];
int seg[4*200005];
void update(int i, int l, int r, int x, int val) {
if(l==r) {
seg[i] += val;
return;
}
int m = (l+r)/2;
if(x<=m) update(i*2+1, l, m, x, val);
else update(i*2+2, m+1, r, x, val);
seg[i] = max(seg[i*2+1], seg[i*2+2]);
}
int dp[100005];*/
int minimumInstructions(int N, int M, int K, std::vector<int> C, vector<int> A, vector<vector<int>> B) {
for(int i=0;i<M;i++) {
for(int k:B[i]) f[k].push_back(i);
}
/*for(int i=0;i<M;i++) {
for(int p:f[C[i]]) update(0, 0, (int)1e5, (p-(i%M)+M)%M, 1);
}
if(seg[0]==M) poss[M-1] = 1;
else return -1;
for(int i=M;i<N;i++) {
for(int p:f[C[i-M]]) update(0, 0, (int)1e5, (p-(i%M)+M)%M, -1);
for(int p:f[C[i]]) update(0, 0, (int)1e5, (p-(i%M)+M)%M, 1);
if(seg[0]==M) poss[i] = 1;
}
int last = M-1;
for(int i=0;i<=last;i++) dp[i] = 1;
for(int i=M;i<N;i++) {
if(last<i-M) return -1;
if(!poss[i]) continue;
for(int j=last+1;j<=i;j++) dp[j] = dp[i-M]+1;
last = i;
}
return dp[N-1];*/
for(int i=0;i<N;i++) {
if(f[C[i]].empty()) return -1;
}
for(int i=1;i<N;i++) {
int last = f[C[i-1]][0];
int cur = f[C[i]][0];
if((last+1)%M!=cur) return -1;
}
return (N+M-1)/M;
}
# | 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... |