AC diary-Element lookup Codevs 1230

1230 Element Lookup

time limit: 1 sspace limit: 128000 KBtitle level: Diamonds Diamond SolvingView Run ResultsTitle Description Description

Given n positive integers, then there are M queries, each asking an integer asking if the integer has occurred in n positive integers.

Enter a description Input Description

The first line is two integers n and M.

Second row n positive integers (1<=n<= 100000)

The third row of M integers (1<=m<=100000)

Output description Output Description

Total M line, if present, output yes, otherwise output no

Sample input Sample Input

4 2

2 1 3 4

1 9

Sample output Sample Output

YES

NO

Data range and Tips Data Size & Hint

All data are not more than 10^8

Ideas:

Map water over;

Come on, on the code:

#include <map>#include<cstdio>using namespacestd;intN,m,cur;map<int,BOOL>if_;intMain () {scanf ("%d%d",&n,&m);  for(intI=1; i<=n;i++) {scanf ("%d",&cur); If_[cur]=true; }     for(intI=1; i<=m;i++) {scanf ("%d",&cur); if(If_[cur]) printf ("yes\n"); Elseprintf"no\n"); }    return 0;}

AC diary-Element lookup Codevs 1230