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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
|
#include <bits/stdc++.h>
#define all(vec) vec.begin(),vec.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)
#define getFro(vec) (vec.empty()?0:vec.front())
#define getBac(vec) (vec.empty()?0:vec.front())
#define debug(var) cerr << #var <<":"<<var<<"\n";
#define DEBUG(variable) \
do { \
std::cerr << #variable << ":"; \
for (const auto& elem : variable) { \
std::cerr << elem << " "; \
} \
std::cerr << "\n"; \
} while (0)
#define uniVec(var) \
do { \
sort(var.begin(),var.end());\
var.resize(unique(var.begin(),var.end())-var.begin());\
} while (0)
#define debugN(var,N) \
do{ \
std::cerr<<#var<<":"; \
FOR(i,1,N){ \
std::cerr<<var[i]<<" "; \
} \
std::cerr<<"\n"; \
}while(0)
#define debugMap(variable) \
do { \
std::cerr << #variable << ":\n"; \
for (const auto& pair : variable) { \
std::cerr << " " << pair.first << " => " << pair.second << "\n"; \
} \
std::cerr << std::endl; \
} while (0)
#define lson(var) (var<<1)
#define rson(var) ((var<<1)+1)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
typedef pair<ll,ll> pll;
typedef array<ll,3> arr3;
typedef array<ll,2> arr2;
typedef double DB;
typedef long double LD;
typedef pair<DB,DB> pdd;
typedef pair<ll,bool> plb;
constexpr ll MAXN=static_cast<ll>(1e2)+10,INF=static_cast<ll>(1e18)+3;
constexpr ll mod=static_cast<ll>(1e9)+7;
constexpr double eps=1e-8;
ll N,M,Q,X,K,T,A[MAXN];
vector<ll> g[MAXN];
ll scr[MAXN];
DB dp[105][(1<<15)+5]; // 25mb
/*
*/
inline void solve(){
cin>>K>>N;
FOR(i,1,N){
cin>>scr[i];
while(true){
ll num;
cin>>num;
if(num==0) break;
g[i].pb(num);
}
}
DB ans=0;
for(int k=K;k>=1;--k){ // 倒过来枚举，因为正过来不一定有合法转移
for(int s=0;s<(1<<N);++s){ // s为获得的宝物清单
for(int idx=1;idx<=N;++idx){ // idx为这一轮获得的宝物编号
ll idx_=idx-1;
bool canTran=true;
FOR(i,0,SZ(g[idx])-1){
if((s|(1<<(g[idx][i]-1)) ) == s){
canTran=true;
}else{ // 如果前提条件中有东西是不存在在
canTran=false;
break;
}
}
#ifdef LOCAL
debug(idx);
debug(canTran);
#endif
if(canTran){
dp[k][s]+=max(dp[k+1][s|(1<<idx_)]+scr[idx],
dp[k+1][s]);
}else{
// 相当于白获得了。
dp[k][s]+=dp[k+1][s];
}
}
dp[k][s]/=N;
#ifdef LOCAL
debug(k);
debug(s);
debug(dp[k][s]);
#endif
}
}
// FOR(s,0,(1<<N)-1){
// ans=max(ans,dp[1][s]);
// }
cout<<setprecision(6)<<fixed<<dp[1][0]<<"\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
// cin>>T;
// while(T--){
// solve();
// }
solve();
return 0;
}
/*
https://www.luogu.com.cn/record/218152633
*/
|