写好优化我不用，就是玩

dfs剪枝，优先遍历情况少的状态

#include<iostream>
#include<algorithm>
using namespace std;
int mp[10][11],H[10],L[10],O[10],ans=-1,ss[11][11],up[10];
int score[10][10]=
{{0,0,0,0,0,0,0,0,0,0},
{0,6,6,6,6,6,6,6,6,6},
{0,6,7,7,7,7,7,7,7,6},
{0,6,7,8,8,8,8,8,7,6},
{0,6,7,8,9,9,9,8,7,6},
{0,6,7,8,9,10,9,8,7,6},
{0,6,7,8,9,9,9,8,7,6},
{0,6,7,8,8,8,8,8,7,6},
{0,6,7,7,7,7,7,7,7,6},
{0,6,6,6,6,6,6,6,6,6}};
bool vis[10][10];
struct xl{
int idx;
int con=0;
}X[10];
bool cmp(xl &x,xl &y)
{
    return x.con>y.con;
}
void dfs(int i,int p,int sum)
{

    if(i==10)
    {
        if(ans<sum) ans=sum;
        return;
    }

    int h=X[i].idx;

    int id=ss[h][p];
    if(id>=10)
    {
        dfs(i+1,1,sum);
        return ;
    }

    for(int j=1,t;j<=9;j++)
    {
        t=1<<j;
        if((H[h]&t)||(L[id]&t)||(O[(h-1)/3*3+(id-1)/3+1]&t)||(up[j]<=0)) continue;
        mp[h][id]=j;
        H[h]|=t;
        L[id]|=t;
        up[j]--;
        O[(h-1)/3*3+(id-1)/3+1]|=t;

        dfs(i,p+1,sum+j*score[h][id]);

        mp[h][id]=0;
        up[j]++;
        H[h]^=t;
        L[id]^=t;
        O[(h-1)/3*3+(id-1)/3+1]^=t;
    }
}
int main()
{
    for(int i=1;i<=9;i++) up[i]=9;
    for(int i=1;i<=9;i++)
        for(int j=1;j<=9;j++)
            cin>>mp[i][j];
    for(int i=1;i<=9;i++) X[i].idx=i;
    for(int i=1;i<=9;i++)
        for(int j=1;j<=9;j++)
            if(mp[i][j]) X[i].con++,up[mp[i][j]]--;
    for(int i=1;i<=9;i++)
        for(int j=1;j<=9;j++)
            if(mp[i][j])
            {
                H[i]|=1<<mp[i][j];
                L[j]|=1<<mp[i][j];
                O[(i-1)/3*3+(j-1)/3+1]|=1<<mp[i][j];
            }
     int sum=0;
     for(int i=1;i<=9;i++)
        for(int j=1;j<=9;j++)
            sum+=mp[i][j]*score[i][j];
     sort(X+1,X+10,cmp);

     for(int i=1;i<=9;i++)
         for(int j=1;j<=10;j++)
            if(!mp[i][j]) ss[i][++ss[i][0]]=j;
     dfs(1,1,sum);
     cout<<ans<<endl;
}