| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1088790 | BABY_GANGSTER | 벽 칠하기 (APIO20_paint) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
//#define int long long
//#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".ans","w",stdout)
#define pb push_back
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
#define getchar_unlocked getchar
inline int scan()
{
char c = getchar_unlocked();
int x = 0;
while(c<'0'||c>'9')
{
c=getchar_unlocked();
}
while(c>='0'&&c<='9')
{
x=(x<<1)+(x<<3)+c-'0';
c=getchar_unlocked();
}
return x;
}
void phongbeo();
const int inf=1e9;
const int mod2=1e9+9;
const int mod1=998244353;
struct icd
{
long double a;
int b;
};
struct ib
{
int a;
int b;
};
struct ic
{
int a,b,c;
};
struct id
{
int a,b,c,d;
};
struct ie
{
int a,b,c,d,e;
};
int n,m,s1,s2,s4,s3,sf,k,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,s33,dem3,dem4,l,r,mid,l2,r2,center;
int i,s10,s12;
int kk;
int el=29;
main()
{
#ifndef ONLINE_JUDGE
/// fin(task);
///fou(task);
#endif
NHP
/// cin>>s1;
///modwwe
phongbeo();
//checktime
}
vector<int> v[100001];
int dp[100001][701];
int a[100001];
int b[100001];
vector<int> v2;
void phongbeo()
{
cin>>n>>m>>k;
for(int i=1; i<=n; i++)
cin>>a[i];
for(int j=1; j<=m; j++)
{
cin>>l;
for(int i=1; i<=l; i++)
{
cin>>r;
v[r].pb(j);
}
}
for(int i=1; i<=n-m; i++)
{
s4++;
l=v[a[i-1]].size()-1;
dem=0;
for(auto x:v[a[i]])
{
dp[i][dem]=s4;
if(i!=1)
{
while(l>=0&&v[a[i-1]][l]>=x)
l--;
if(l>=0)
if(v[a[i-1]][l]==x-1)
dp[i][dem]=min(dp[i][dem],dp[i-1][l]);
s8=v[a[i-1]].size()-1;
if(x==1&&v[a[i-1]].back()==m)dp[i][dem]=min(dp[i][dem],dp[i-1][s8]);
}
s4=min(s4,dp[i][dem]);
dem++;
}
}
dem=0;
for(int i=n-m+1;i<=n;i++)
{
if(i==n-m+1)
for(auto x:v[a[i]])
b[x]=1;
else
{bool de=0;
for(auto x:v[a[i]])
if(b[x-1]==dem)
de=1,b[x]=dem+1;
else if(x==1)
if(b[m]==dem) de=1,b[x]=dem+1;
if(!de){cout<<-1; return;}
}
dem++;
}
cout<<s4+1;
}