bzoj5248 [2018多省省队联测]一双木棋

直接hash+爆搜即可。

 #include <cstdio>
 #include <cstring>
 #include <iostream>
 #include <algorithm>
 #include <cmath>
 #include <map>
 #define inf 0x3fffffff
 using namespace std;
 int n,m,a[][][];
 map<long long,int> mm;
 struct data{
     int x[],o;
 }dd;
 long long geth(data d){
     long long ans=;
     for(register int i=;i<=n;++i)ans=ans*+d.x[i];
     return ans;
 }
 int dfs(data d){
     if(d.x[n]==m)return ;
     long long H=geth(d);
     if(mm.count(H))return mm[H];
     data nd;
     int ans=-inf;
     for(register int i=;i<=n;++i)if(d.x[i]<m&&(i==||d.x[i-]>d.x[i])){
         nd=d;nd.o^=;++nd.x[i];
         ans=max(ans,a[d.o][i][d.x[i]+]-dfs(nd));
     }
     return mm[H]=ans;
 }
 int main(){
     scanf("%d%d",&n,&m);
     for(register int i=;i<=n;++i)
         for(register int j=;j<=m;++j)
             scanf("%d",&a[][i][j]);
     for(register int i=;i<=n;++i)
         for(register int j=;j<=m;++j)
             scanf("%d",&a[][i][j]);
     dd.o=;
     memset(dd.x,,sizeof dd.x);
     printf("%d\n",dfs(dd));
     return ;
 }