hdu-4696

对于d来说，只有所有的c都为2，并且d为奇数的时候，才输出NO，当然，d<0的时候也输出NO。

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#include<stdlib.h>
#define INF_MAX 0x7fffffff
#define INF 999999
#define max3(a,b,c) (max(a,b)>c?max(a,b):c)
#define min3(a,b,c) (min(a,b)<c?min(a,b):c)
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
#define ll __int64
#define maxn 10001
#define maxm 100001
struct node
{
    int u;
    int v;
    int w;
    bool friend operator < (node a, node b){
        return a.w < b.w;
    }
}edge[maxn];
ll gcd(ll n,ll m){if(n<m) swap(n,m);return n%m==0?m:gcd(m,n%m);}
ll lcm(ll n,ll m){if(n<m) swap(n,m);return n/gcd(n,m)*m;}
int main()
{
    int n,q,i,c;
    while(~scanf("%d%d",&n,&q))
    {
        int leap=0;
        for(i=1;i<=n;i++)scanf("%d",&c);
        for(i=1;i<=n;i++)
        {
            scanf("%d",&c);
            if(c==1)leap=1;
        }
        for(i=1;i<=q;i++)
        {
            scanf("%d",&c);
            if(c<=0)printf("NO\n");
            else if((c%2)&&leap==0)printf("NO\n");
            else printf("YES\n");
        }
    }
    return 0;
}