oj.uz

Submission #976731

# Submission time Handle Problem Language Result Execution time Memory
976731 2024-05-07T04:27:49 Z vjudge1 Pizza (COCI21_pizza) C++17
50 / 50
 1 ms 348 KB 
#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;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct