Submission #975218

# Submission time Handle Problem Language Result Execution time Memory
975218 2024-05-04T15:01:17 Z vjudge1 Pizza (COCI21_pizza) C++17
0 / 50
1000 ms 496 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;
	multiset<int>a;
	for(int i=0; i<n; i++) {
		int b; cin>>b;
		a.insert(b);
	}
	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(a.find(c) != a.end()) {
				pos=false;
				break;
			}
		}
		if(pos) ++ans;
	}
	cout<<ans+1;
}
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1083 ms 496 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1038 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -