1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<set>
#include<bitset>
#include<assert.h>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-8
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define mid (x+y)/2
#define NM 5005
#define nm 5005
#define pi 3.1415926535897931
using namespace std;
const ll inf=1e9+7;
ll read(){
ll x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f*x;
}
struct edge{int t;edge*next;}e[nm],*h[NM],*o=e;
void add(int x,int y){o->t=y;o->next=h[x];h[x]=o++;}
int n,m,a[NM],b[NM],c[NM],ans[NM],v[NM],s,_x,p,match[NM];
bool _v[NM];
bool dfs(int x){
link(x)if(v[j->t]!=_x){
v[j->t]=_x;
if(!match[j->t]||dfs(match[j->t])){match[j->t]=x;return true;}
}
return false;
}
int main(){
n=read();m=read();
inc(i,1,n)a[i]=read();
inc(i,1,n)b[i]=read();
p=read();
inc(i,1,p)c[i]=read(),_v[c[i]]++;
inc(i,1,n)if(!_v[i])add(a[i]+1,b[i]);
while(dfs(_x=s+1))s++,_x++;
dec(i,p,1){
ans[i]=s;
add(a[c[i]]+1,b[c[i]]);
_x++;
while(dfs(s+1))s++,_x++;
}
inc(i,1,p)printf("%d\n",ans[i]);
return 0;
}
|
