1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
| #include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#define MAX_N 101
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vall3 vector<array<ll,3>>
#define vll vector<ll>
#define vs vector<string>
#define usll unordered_set<ll>
#define vvs vector<vs>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
using namespace std;
ll n,m,req = 0;
vll adj[MAX_N];
ll seen[MAX_N], match[MAX_N * MAX_N];
usll fin, subject;
bool dfs(ll u, ll s) {
seen[u] = s;
for(auto& v : adj[u]) {
if(match[v] == -1 or (seen[match[v]] != s and dfs(match[v], s))) {
match[v] = u;
return true;
}
}
return false;
}
vll solve() {
memset(match, -1, sizeof match);
memset(seen, -1, sizeof seen);
ll s = 1, ma = 0;
for(auto& a : fin) {
if(dfs(a, s++)) ma++;
}
vll sub(all(subject)), res;
sort(all(sub));
for(auto& S : sub) {
if(fin.count(S)) continue;
if(ma == req) break;
if(dfs(S, s++)) {
ma++;
res.push_back(S);
}
}
if(ma < req) {
cout<<"-1"; exit(0);
}
return res;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.setf(ios::fixed);
cout.precision(6);
ll t,w;
cin>>n;
for(ll i = 0; i < n; i++) {
cin>>t;
fin.insert(t);
}
cin>>m;
for(ll i = 101, c; i < 101 + m; i++) {
cin>>w>>c;
while(c--) {
cin>>t;
subject.insert(t);
for(ll k = 0; k < w; k++)
adj[t].push_back(req + k);
}
req += w;
}
auto res = solve();
cout<<res.size()<<'\n';
for(auto& n : res) cout<<n<<' ';
return 0;
}
|
