#include <iostream>
#include <string>
#include<cstdio>
#include <vector>
using namespace std;
int main(){
int m,n;
cin>>n>>m;
vector<string> vn;
string s;
for(int i=0; i <n; ++i)
{
cin >> s;
vn.push_back(s);
}
vector<string> vm;
for(int i=0; i <m; ++i)
{
cin >> s;
vm.push_back(s);
}
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
if(vm[i]!=vn[j]){
if(j==n-1){
cout<<"NO"<<endl;
}
}
if(vm[i]==vn[j]){
cout<<"YES"<<endl;
break;
}
}
}
}
解法二:map标记
#include<bits/stdc++.h>
using namespace std;
map<string,int>mp;
int a,b;
char str[25];
int main()
{
cin>>a>>b;
while(a--)
{
scanf("%s",str);
mp[str]++;
}
while(b--)
{
scanf("%s",str);
if(mp[str])
{
printf("NO\n");
}
else
{
printf("YES\n");
}
mp[str]++;
}
return 0;
}