Submission #976731

#TimeUsernameProblemLanguageResultExecution timeMemory
976731vjudge1Pizza (COCI21_pizza)C++17
50 / 50
1 ms348 KiB
#include <bits/stdc++.h>
using namespace std;
int main(){
	int N,M,ans=0;
	cin>>N;
	int A[N];
	for(int i=0; i<N; i++){
		cin>>A[i];
	}
	cin>>M;
	int B[M][100];
	memset(B,0,sizeof(B));
	for(int i=0; i<M; i++){
		int K;
		cin>>K;
		for(int j=0; j<K; j++){
			cin>>B[i][j];
		}
	}
	for(int i=0; i<M; i++){
		bool gsuka=false;
		for(int j=0; j<100; j++){
			if(gsuka) break;
			if(B[i][j]==0){
				ans++;
				break;
			}
			for(int k=0; k<N; k++){
				if(B[i][j]==A[k]){
					gsuka=true;
					break;
					
				}
			}
		}
	}
	cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...