oj.uz

Submission #975229

# Submission time Handle Problem Language Result Execution time Memory
975229 2024-05-04T15:07:48 Z vjudge1 Pizza (COCI21_pizza) C++17
50 / 50
 1 ms 348 KB 
#include<bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int maxn=1e5+5;
int main() {
	int n,ans=0; cin>>n;
	bool g[105];
	memset(g,0,sizeof(g));
	for(int i=0; i<n; i++) {
		int b; cin>>b;
		g[b]=true;
	}
	int m; cin>>m;
	for(int i=0; i<m; i++) {
		bool pos=true;
		int k; cin>>k;
		while(k--) {
			int c; cin>>c;
			if(g[c]) {
				pos=false;
				continue;
			}
		}
		if(pos) ++ans;
	}
	cout<<ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 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 1 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 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #5
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