UVA_10919_Pre_Requisites

#include <iostream>
#include <sstream>
#include <bitset>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <numeric>

using namespace std;

typedef pair<int,int> ii ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int,ii> pii ;

bool buscar(int v[],int c,int k){
int i=0;
for(i=0;i<k;i++){
if(v[i]==c) return true;

}
return false;
}
int main(){
int k,m,ncourses,mincourses,c,vale;
bool found;
while (scanf("%d",&k)){
if(k==0) break;
scanf("%d",&m);
vale=0;bool cumplio=true;
int v[k+1];
for (int i=0;i<k;i++){
scanf("%d",&v[i]);
}
for (int i=0;i<m;i++){
scanf("%d %d",&ncourses,&mincourses);
for(int j=0;j<ncourses;j++){
scanf("%d",&c);
found=buscar(v,c,k);
if (found){
vale++;
}
}
if(vale<mincourses){
cumplio=false;
vale=0;

}else{
vale=0;
if(!cumplio){
cumplio=false;
}else{
cumplio=true;
}

}
}
if (cumplio){
printf("yes\n");
}else{
printf("no\n");
}

}
return 0 ;
}