HDU 4696 Answers （水题）

来源：互联网发布：程序员的呐喊下载编辑：程序博客网时间：2024/05/16 12:14

看题看了好长时间，看懂之后，想了好久。终于yy了一种方法，只考虑是否有1。写了一下，提交a了。

#include <iostream>#include <cmath>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>#include <stack>#include <map>#include <set>#include <list>#include <deque>#include <string>#define LL long long#define DB double#define SI(a) scanf("%d",&a)#define SD(a) scanf("%lf",&a)#define SS(a) scanf("%s",a)#define SF scanf#define PF printf#define MM(a,b) memset(a,b,sizeof(a))#define REP(i,a,b) for(int (i)=(a);(i)<(b);(i)++)#define N 100009#define INF 0x3f3f3f3f#define EPS 1e-8#define bug puts("bug")using namespace std;int visit[N];int main(){    #ifndef ONLINE_JUDGE    freopen("in.txt","r",stdin);    #endif    int n,m,a;    while(~SF("%d%d",&n,&m))    {        REP(i,0,n) SI(a);        int one = 0;        REP(i,0,n)        {            SI(a);            if(a==1) one = 1;        }        REP(i,0,m)        {            SI(a);            if(a<=0||(one==0&&(a&1)))            {                puts("NO");            }else            {                puts("YES");            }        }    }    return 0;}