#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
#pragma GCC optimize("Ofast")
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#include "paint.h"
const int INF = 1e9 + 7;
const int maxn = 1e5 + 5;
int st[maxn], ed[maxn], valid[maxn], dp[maxn], dq[maxn];
vector<int> pos[maxn];
int minimumInstructions(
int n, int m, int k, std::vector<int> c,
std::vector<int> a, std::vector<std::vector<int>> b) {
for(int i = 0; i < n; i++) pos[c[i]].pb(i);
for(int i = 0; i < n; i++) st[i] = -1, ed[i] = m;
for(int i = 0; i < m; i++){
for(int j = 0; j < a[i]; j++){
for(auto x : pos[b[i][j]]){
if(x >= i){
if(st[x - i] == i - 1) st[x - i] ++;
}
}
}
}
for(int i = m - 1; i >= 0; i--){
for(int j = 0; j < a[i]; j++){
for(auto x : pos[b[i][j]]){
if(x + m - i < n){
if(ed[x + m - i] == i + 1) ed[x + m - i] --;
}
}
}
}
for(int i = 0; i < n; i++){
int l = ed[i], r = st[i];
int len = r - l + 2;
if(len <= 0) continue;
valid[i - (m - l)] ++;
if(i - (m - l) + len < n) valid[i - (m - l) + len] --;
}
for(int i = 1; i < n; i++) valid[i] += valid[i - 1];
if(!valid[0]) return -1;
int l = 0, r = 0;
dq[l] = 0, dp[0] = 1;
if(m >= n) ans = 1;
int ans = INF;
for(int i = 1; i < n; i++){
if(!valid[i]) continue;
while(l <= r && dq[l] < i - m) l++;
if(l > r) break;
dp[i] = dp[dq[l]] + 1;
while(l <= r && dp[dq[r]] >= dp[i]) r--;
dq[++r] = i;
if(i >= n - m) ans = min(ans, dp[i]);
}
return ans < INF ? ans : -1;
}
Compilation message
paint.cpp: In function 'int minimumInstructions(int, int, int, std::vector<int>, std::vector<int>, std::vector<std::vector<int> >)':
paint.cpp:51:16: error: 'ans' was not declared in this scope; did you mean 'abs'?
51 | if(m >= n) ans = 1;
| ^~~
| abs
