제출 #99753

#제출 시각아이디문제언어결과실행 시간메모리
99753tnbs10Alkemija (COCI18_alkemija)C++11
8 / 80
100 ms2316 KiB
#include <bits/stdc++.h>
using namespace std;

int n, m, k, l, r, a[100001], ai, bi, counter;
bool flag;

int main()
{
	cin >> n >> m;
	counter = m;
	for (int i = 0; i < m; ++i){
		cin >> ai;
		a[ai] = 1;
	}
	cin >> k;
	for (int i = 0; i < k; i++){
		cin >> l >> r;
		flag = true;
		for (int j = 0; j < l; ++j){
			cin >> bi;
			if (not a[bi]) flag = false;
		}
		for (int j = 0; j < r; j++){
			cin >> bi;
			if (flag and not a[bi]){
				counter++;
				a[bi] = 1;
			}
		}
	}
	cout << counter << endl;
	for (int i = 0; i < 100001; i = i + 1){
		if (a[i]) cout << i << " ";
	}
	return 0;
}
#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...
#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...