题意:
给出一个类似静态链表的结构,T表示指针数组,C表示数值,都有n个元素。1<=Ti<=n,1<=Ci<=2。问按访问顺序累加表中元素能否得到某个值。
思路:
由题容易发现,因为1<=Ti<=n,这个静态链表一定存在循环。又因为1<=Ci<=2,所以当有1时,可以累加出任何数字。当Ci没有1时,只能累加出偶数。
代码:
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <map>
#include <list>
#include <set>
#include <stack>
#include <queue>
#include <string>
#include <sstream>
#define pb push_back
#define X first
#define Y second
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
#define pii pair<int,int>
#define qclear(a) while(!a.empty())a.pop();
#define lowbit(x) (x&-x)
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define mst(a,b) memset(a,b,sizeof(a))
#define cout3(x,y,z) cout<<x<<" "<<y<<" "<<z<<endl
#define cout2(x,y) cout<<x<<" "<<y<<endl
#define cout1(x) cout<<x<<endl
#define IOS std::ios::sync_with_stdio(false)
#define SRAND srand((unsigned int)(time(0)))
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
using namespace std;
const double PI=acos(-1.0);
const int INF=0x3f3f3f3f;
const ll mod=998244353;
const double eps=1e-8;
const int maxn=100005;
const int maxm=10005;
int n,q;
int t[maxn];
int c[maxn];
void solve() {
while(~sd(n)){
sd(q);
for(int i=1;i<=n;i++){
sd(t[i]);
}
bool ok=0;
for(int i=1;i<=n;i++){
sd(c[i]);
if(c[i]==1){
ok=1;
}
}
for(int i=0;i<q;i++){
int now;
sd(now);
if(now<=0){
printf("NO\n");
}else if(ok){
printf("YES\n");
}else {
if(now%2==0){
printf("YES\n");
}else{
printf("NO\n");
}
}
}
}
return ;
}
int main() {
#ifdef LOCAL
freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
#else
// freopen("","r",stdin);
// freopen("","w",stdout);
#endif
solve();
return 0;
}