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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
| #include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define fi first
#define se second
#define pb push_back
#define SZ(a) ((int) a.size())
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (int i = (a); i >= (b); --i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
typedef pair<ll,ll> pll;
typedef array<ll,3> arr;
typedef double DB;
typedef pair<DB,DB> pdd;
typedef pair<ll,bool> plb;
constexpr ll MAXN=static_cast<ll>(1e3)+10,INF=static_cast<ll>(1e18)+3;
constexpr ll mod=static_cast<ll>(1e9)+7;
constexpr double eps=1e-8;
ll N,M,K,T,Cost[MAXN];
vector<ll> g[MAXN];
ll pw[20];
inline void solve(){
cin>>N>>M;
FOR(i,1,N){
cin>>Cost[i];
}
FOR(i,1,M){
cin>>K;
FOR(j,1,K){
ll u;
cin>>u;
g[u].pb(i);
}
}
pw[0]=1;
FOR(i,1,N){
pw[i]=pw[i-1]*3;
}
ll ans=INF;
FOR(i,0,pw[N]){
ll opi=i,idx=1,ct=0;
vector<ll> Cnt(M,0);
while(opi){
ll rem=opi%3;
if(rem!=0){
ct+=Cost[idx]*rem;
FOR(j,0,SZ(g[idx])-1){
Cnt[g[idx][j]-1]+=rem;
}
}
++idx;
opi/=3;
}
if(*min_element(all(Cnt))>=2){
ans=min(ct,ans);
}
}
cout<<ans<<"\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
solve();
return 0;
}
|