/*
Author: Ritik Patel
*/
//&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& STL DEBUGGER &&&&&&&&&&&&&&&&&&&&&&&&&&&
// #define _GLIBCXX_DEBUG // Iterator safety; out-of-bounds access for Containers, etc.
// #pragma GCC optimize "trapv" // abort() on (signed) integer overflow.
//&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& LIBRARIES &&&&&&&&&&&&&&&&&&&&&&&&&&&
#include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
template<typename T, typename V = __gnu_pbds::null_type>
using ordered_set = __gnu_pbds::tree<T, V, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;
*/
//find_by_order()->returns an iterator to the k-th largest element(0-based indexing)
//order_of_key()->Number of items that are strictly smaller than our item
//&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& DEFINES &&&&&&&&&&&&&&&&&&&&&&&&&&&
#define int long long int
// #define ll long long int
#define all(i) i.begin(), i.end()
#define sz(a) (int)a.size()
// #define ld long double
// const ld PI = 3.141592;
const int dx4[4] = {0, 1, 0, -1};
const int dy4[4] = {-1, 0, 1, 0};
const int dx8[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
const int dy8[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
//&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& DEBUG &&&&&&&&&&&&&&&&&&&&&&&&&&&
#define XOX
vector<string> vec_splitter(string s) {
for(char& c: s) c = c == ','? ' ': c;
stringstream ss; ss << s;
vector<string> res;
for(string z; ss >> z; res.push_back(z));
return res;
}
void debug_out(vector<string> __attribute__ ((unused)) args, __attribute__ ((unused)) int idx) { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, Head H, Tail... T) {
if(idx > 0) cerr << ", ";
stringstream ss; ss << H;
cerr << args[idx] << " = " << ss.str();
debug_out(args, idx + 1, T...);
}
#ifdef XOX
#define debug(...) debug_out(vec_splitter(#__VA_ARGS__), 0, __VA_ARGS__)
#else
#define debug(...) 42
#endif
//&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& CODE &&&&&&&&&&&&&&&&&&&&&&&&&&&
int N, M, K;
const int MAXN = 1e5 + 5;
bool mark[MAXN];
vector<int> A[MAXN], B[MAXN];
void solve(){
cin >> N >> M;
for(int i = 1, x; i <= M; ++i){
cin >> x;
mark[x] = true;
}
cin >> K;
for(int i = 1; i <= K; ++i){
int l, r; cin >> l >> r;
vector<int> a(l), b(r);
for(auto &x: a){
cin >> x;
}
for(auto &x: b){
cin >> x;
}
A[i] = a, B[i] = b;
}
for(int j = 0; j < 2; ++j){
for(int i = 1; i <= K; ++i){
bool poss1 = true;
for(auto &x: A[i]){
poss1 &= mark[x] == true;
}
if(!poss1){
continue;
}
for(auto &x: B[i]){
mark[x] = true;
}
}
}
int total = 0;
for(int i = 1; i <= N; ++i){
total += mark[i];
}
cout << total << '\n';
for(int i = 1; i <= N; ++i){
if(mark[i]){
cout << i << " ";
}
}
cout << '\n';
}
int32_t main(){
ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
int T = 1;
// cin >> T;
for(int i = 1; i <= T; ++i){
// brute();
solve();
}
return 0;
}
/*
Sample inp
*/
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
9 ms |
4992 KB |
Output isn't correct |
| 2 |
Incorrect |
8 ms |
5044 KB |
Output isn't correct |
| 3 |
Incorrect |
8 ms |
5044 KB |
Output isn't correct |
| 4 |
Incorrect |
8 ms |
5128 KB |
Output isn't correct |
| 5 |
Incorrect |
7 ms |
4992 KB |
Output isn't correct |
| 6 |
Incorrect |
7 ms |
5120 KB |
Output isn't correct |
| 7 |
Incorrect |
9 ms |
5120 KB |
Output isn't correct |
| 8 |
Incorrect |
7 ms |
4992 KB |
Output isn't correct |
| 9 |
Incorrect |
8 ms |
5120 KB |
Output isn't correct |
| 10 |
Incorrect |
8 ms |
4992 KB |
Output isn't correct |
