OJ Board

Code: Select all

3 2
0123 9876 2222
2 1 8888 2222
3 1 3172 2222 7654 
3 2
0123 9876 2222
2 1 8888 2222
3 2 0123 9876 2222
0

Code: Select all

#include<stdio.h>

int main(){
	long n,m,array[150],n1,m1,ccount,i,k,test[150],itr,it,flag1=0;
	bool flag[150];
	while(1){
		k=0;
		scanf("%ld",&n);
		if(n==0)break;
		scanf("%ld",&m);
		for(i=0;i<n;i++)scanf("%ld",&array[i]);
		for(int tr=0;tr<m;tr++){
			ccount=0;
			scanf("%ld",&n1);
			scanf("%ld",&m1);
			for(itr=0;itr<n1;itr++)scanf("%ld",&test[itr]);
			for(itr=0;itr<n1;itr++){
				for(it=0;it<n;it++){
					if(test[itr]==array[it])ccount++;
				}
				if(ccount>=m1){flag[k]=true;k++;}
			}
			if(ccount<m1){flag[k]=false;k++;}
		}
		for(it=0;it<k;it++){
			if(flag[it]==false){
				printf("no\n");
				flag1=0;
				break;
			}
			else flag1=1;
		}
		if(flag1==1)printf("yes\n");
		for(it=0;it<k;it++)flag[it]=false;
		flag1=0;
	}
	return 0;
}

Code: Select all

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;

typedef vector<int> vi;
bool indexB(vi& a, int f)
{
	int low = 0, high = a.size()-1, mid;
	while(low <= high)
	{
		mid = (low+high)/2;
		if(a[mid] == f)
			return true;
		if(a[mid] > f)
			high = mid-1;
		if(a[mid] < f)
			low = mid+1;
	}
	return false;
}
int main()
{
	freopen("input.txt", "r", stdin);
	vi taken, same;
	int k, m, c, r, num;
	while(scanf("%d", &k), k)
	{
		scanf("%d", &m);
		int ctaken;
		bool flag = true;
		for(int i = 0; i < k; i++)
		{
			scanf("%d", &ctaken);
			taken.push_back(ctaken);
		}
		sort(taken.begin(), taken.end());
		/*for(int i = 0; i < taken.size(); i++)
		{
			printf("%d ", taken[i]);
		}*/
		for(int i = 0; i < m; i++)
		{
			scanf("%d %d", &c, &r);
			//printf("%d %d\n", c, r);
			int check = 0;
			for(int j = 0; j < c; j++)
			{
				scanf("%d", &num);
				if(indexB(taken, num)){
					check++;}
			}
			if(check < r){
				flag = false;}
		}
		//cout << indexB(taken, 2222) << endl;
		printf((flag) ? "yes\n": "no\n");
	}
	return 0;
}