@[dottle](/user/79067) @[chen_zhe](/user/8457)
估计忘记了吧
by __er @ 2022-11-02 18:30:02
蓝吧，费用流也能做
by Network_Error @ 2022-11-02 18:46:27
@[Network_Error](/user/534654) 是不是状压也OK？
by YuRuochen @ 2022-11-02 19:05:20
@[Network_Error](/user/534654) 但无论如何，这题也不是绿题啊
by YuRuochen @ 2022-11-02 19:05:41
@[Network_Error](/user/534654) 状压1.06ms，啊！我太难了。。。
```cpp
#include<bits/stdc++.h>
using namespace std;
int n,p[21][21],q[21][21],dp[21][1<<20];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) scanf("%d",&p[i][j]);
for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) scanf("%d",&q[i][j]);
for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) p[i][j]*=q[j][i];
for(int i=1;i<=n;i++){
for(int j=0;j<(1<<n);j++){
for(int k=1;k<=n;k++){
if((j>>k-1)&1) dp[i][j]=max(dp[i][j],dp[i-1][j-(1<<k-1)]+p[i][k]);
}
}
}
printf("%d",dp[n][(1<<n)-1]);
return 0;
}
```
by YuRuochen @ 2022-11-02 19:09:26
我觉得好歹是个蓝
by Resolute_Faith @ 2022-11-03 07:49:23