Submission #975489

#TimeUsernameProblemLanguageResultExecution timeMemory
975489vjudge1Pizza (COCI21_pizza)C++17
50 / 50
1 ms348 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long

int main(){
	ll n, m, ans = 0; cin >> n;
	vector<ll> v(n);
	for(ll i = 0; i < n; i++){
		cin >> v[i];
	}
	cin >> m;
	while(m--){
		ll x;
		cin >> x;
		bool ok = true;
		unordered_set<ll> s;
		for(ll i = 0; i < x; i++){
			ll c;
			cin >> c;
			s.insert(c);
		}
		for(auto &i : v){
			if(s.find(i) != s.end()){
				ok = false;
				break;
			}
		}
		if(ok) ans++;
	}
	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...