#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
int minimumInstructions(int n,int m,int k,vector<int>C,vector<int>A,vector<vector<int>>B){
vector<vector<int>>q(n,vector<int>(m));
vector<vector<bool>>have(k,vector<bool>(m,0));
for(int i=0;i<m;i++){
for(auto x:B[i]){
have[x][i]=true;
}
}
for(int i=n-1;i>=0;i--){
for(int j=0;j<m;j++){
if(have[C[i]][j]==false){
q[i][j]=-1e9;
}
else if(i==n-1||have[C[i+1]][(j+1)%m]==false){
q[i][j]=1;
}
else{
q[i][j]=q[i+1][(j+1)%m]+1;
}
}
}
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cout<<q[i][j]<<' ';
}
cout<<'\n';
}
vector<int>mn(n+1,1e9);
mn[n]=0;
multiset<int>st;
for(int i=n-m+1;i<=n;i++){
st.insert(mn[i]);
}
for(int i=n-m;i>=0;i--){
bool ok=false;
for(int j=0;j<m;j++){
if(q[i][j]>=m){
ok=true;
break;
}
}
if(ok){
mn[i]=*st.begin()+1;
}
st.erase(st.find(mn[i+m]));
st.insert(mn[i]);
}
if(mn[0]>=1e9) return -1;
return mn[0];
}
int main(){
int n,m,k;
cin>>n>>m>>k;
vector<int>c(n),a(m);
vector<vector<int>>b(m);
for(auto &x:c) cin>>x;
for(auto &x:a) cin>>x;
for(int i=0;i<m;i++){
b[i].resize(a[i]);
for(auto &x:b[i]){
cin>>x;
}
}
cout<<minimumInstructions(n,m,k,c,a,b);
}
Compilation message
/usr/bin/ld: /tmp/cczFvv8G.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/cc6paH8G.o:paint.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status
