//代码一AC：用邻接表-hash----就是有点耗内存#include<stdio.h>
#include<malloc.h>
struct Node
{int num;struct Node *next;
};int main()
{    int n,m,temp,i;struct Node *t1,*node;scanf("%d%d",&m,&n);node=(struct Node *)malloc(m*sizeof(struct Node));for(i=0;i<m;++i){//    node[i].num=i;node[i].next=NULL;}for(i=0;i<m;++i){scanf("%d",&temp);t1=(struct Node *)malloc(sizeof(struct Node));t1->num=temp;t1->next=node[temp%m].next;node[temp%m].next=t1;}for(i=0;i<n;++i){scanf("%d",&temp);t1=node[temp%m].next;while(t1){if(t1->num==temp){printf("YES\n");break;}t1=t1->next; }if(t1==NULL)printf("NO\n");    }return 0;
}//代码二：二分查找----超时#include<stdio.h>
#include<stdlib.h>
/*
//递归二分超时
int search(int *p,int t,int low,int high)
{int mid;//mid=(high+low)/2;mid=low+(high-low)/2if(p[mid]==t)return 1;if(low>=high)return 0;else if(p[mid]>t)return search(p,t,low,mid-1);elsereturn search(p,t,mid+1,high);
}
*/int search(int *p,int t,int low,int high)//仍然超时
{int mid;while(low<=high){mid=low+(high-low)/2;if(p[mid]==t)return 1;   else if(p[mid]<t)  low=mid+1;  else  high=mid-1;}return 0;
}int main()
{int n,m,i,j,t,flag=1;int *p;scanf("%d%d",&m,&n);p=(int *)malloc((m+1)*sizeof(int));for(i=1;i<=m;++i)scanf("%d",&p[i]);for(i=m;flag&&i>0;--i){flag=0;for(j=1;j<m;++j)//事实证明我的排序超时了if(p[j]>p[j+1]){flag=1;p[j]=p[j]^p[j+1];p[j+1]=p[j]^p[j+1];p[j]=p[j]^p[j+1];}}for(i=1;i<=n;++i){scanf("%d",&t);if(search(p,t,1,m))printf("YES\n");elseprintf("NO\n");}return 0;
}//代码三：网上AC代码，也是二分
#include<stdio.h>
#include<algorithm>
using namespace std;
int a[1000005];
int main()
{int n,s,t,i,j,flag1;scanf("%d %d",&s,&n);for(i=0;i<s;i++){scanf("%d",&a[i]);}sort(a,a+s);/*for(i=s;flag1&&i>0;--i)//改成冒泡超时{flag1=0;for(j=1;j<s;++j)if(a[j]>a[j+1]){flag1=1;a[j]=a[j]^a[j+1];a[j+1]=a[j]^a[j+1];a[j]=a[j]^a[j+1];}}*/for(i=0;i<n;i++){int first=0,last=s,mid,flag=0;//**标记**//scanf("%d",&t);while(first<=last)//**二分**//{mid=first+(last-first)/2;if(a[mid]==t){flag=1;break;}else if(a[mid]<t)first=mid+1;elselast=mid-1;}if(flag==1)printf("YES\n");elseprintf("NO\n");}return 0;
}        //代码四：最优代码2012年12月7日-----现在回过头来看 顿时明白了#include <stdio.h>
#define MAXN 3125010
int vis[MAXN] = {0} ;   // vis数组中存储的就是一个32位的二进制数,下标i代表所得数是32的多少倍，　　　　　　　　　　　　　　//而其中存储的二进制数的每一位则代表所得数的关于32的模，很巧妙..
int main()
{int m , n , x ; int i ;scanf("%d%d", &m , &n ) ;for( i = 0 ; i < m ; ++i ){scanf("%d", &x ) ;vis[ x / 32 ] |= 1 << x % 32 ;}for( i = 0 ; i < n ; ++i ){scanf("%d", &x ) ;if( vis[ x / 32 ] & ( 1 << x % 32 ) )printf("YES\n");elseprintf("NO\n");}return 0 ;
}