93 lines
2.0 KiB
C++
93 lines
2.0 KiB
C++
#include <cstdio>
|
|
#include <cstring>
|
|
#include <cmath>
|
|
#include <vector>
|
|
#include <map>
|
|
#include <algorithm>
|
|
#include <iostream>
|
|
using namespace std;
|
|
#define LL __int64
|
|
#define maxn 100011
|
|
int t[maxn],c[maxn],n,q,m[maxn],vis[maxn],a[maxn],b[maxn];
|
|
map<int,map<int,int> >nn;
|
|
map<int,int>mm;
|
|
map<int,int>ll;
|
|
int bb[1001];
|
|
int flag[maxn],s[maxn],ss[maxn];
|
|
void find(int x)
|
|
{
|
|
ll.clear();
|
|
int tt=1,i,j,k,y,z,d;
|
|
s[0]=0;s[1]=c[x];ll[x]=1,ss[1]=x;
|
|
for(i=2;;i++)
|
|
{
|
|
vis[x]=1;
|
|
x=t[x];
|
|
ss[i]=x;
|
|
if(ll[x])
|
|
break;
|
|
if(vis[x])
|
|
{
|
|
for(j=i-1;j>=1;j--)
|
|
{
|
|
a[ss[j]]=s[i-1]-s[j-1]+a[x];
|
|
b[ss[j]]=b[x];
|
|
}
|
|
return;
|
|
}
|
|
ll[x]=++tt;
|
|
s[i]=s[i-1]+c[x];
|
|
}
|
|
d=s[i-1]-s[ll[x]-1];
|
|
for(j=1;j<i;j++)
|
|
{
|
|
if(j<=ll[x])
|
|
a[ss[j]]=s[ll[x]-1]-s[j-1];
|
|
else
|
|
a[ss[j]]=s[i-1]-s[j-1];
|
|
b[ss[j]]=d;
|
|
}
|
|
}
|
|
int main()
|
|
{
|
|
while(scanf("%d%d",&n,&q)!=EOF)
|
|
{
|
|
int i,j,k;
|
|
for(i=1;i<=n;i++)
|
|
scanf("%d",&t[i]);
|
|
for(i=1;i<=n;i++)
|
|
scanf("%d",&c[i]);
|
|
for(i=1;i<=q;i++)
|
|
scanf("%d",&m[i]);
|
|
memset(vis,0,sizeof(vis));
|
|
for(i=1;i<=n;i++)
|
|
{
|
|
if(!vis[i])
|
|
find(i);
|
|
}
|
|
mm.clear();
|
|
nn.clear();
|
|
int tt=0;
|
|
for(i=1;i<=n;i++)
|
|
{
|
|
if(mm[b[i]]==0)
|
|
{
|
|
mm[b[i]]=++tt;
|
|
bb[tt]=b[i];
|
|
}
|
|
nn[tt][a[i]]=1;
|
|
}
|
|
memset(flag,0,sizeof(flag));
|
|
for(j=1;j<=q;j++)
|
|
{
|
|
if(m[j]<=0)continue;
|
|
for(i=1;i<=tt;i++)
|
|
if(nn[i][m[j]%bb[i]]){flag[j]=1;break;}
|
|
}
|
|
for(i=1;i<=q;i++)
|
|
if(flag[i])printf("YES\n");
|
|
else printf("NO\n");
|
|
}
|
|
return 0;
|
|
}
|