【CCF】棋局评估

博弈论极小极大搜索，记忆化+状压

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
const int maxn=2e4+;
const int inf=;
int a[];
int three[];
int tmp[];
int ans[maxn][];
void pre(){
    three[]=;
    for(int i=;i<;i++){
        three[i]=three[i-]*;
    }
}
int judge(vector<int> tmp){
    int res=;
    for(int i=;i<;i++){
        res+=(tmp[i]==);
    }
    //ALice
    if(tmp[]==&&tmp[]==&&tmp[]==){
        return res+;
    }
    if(tmp[]==&&tmp[]==&&tmp[]==){
        return res+;
    }
    if(tmp[]==&&tmp[]==&&tmp[]==){
        return res+;
    }
    if(tmp[]==&&tmp[]==&&tmp[]==){
        return res+;
    }
    if(tmp[]==&&tmp[]==&&tmp[]==){
        return res+;
    }
    if(tmp[]==&&tmp[]==&&tmp[]==){
        return res+;
    }
    if(tmp[]==&&tmp[]==&&tmp[]==){
        return res+;
    }
    if(tmp[]==&&tmp[]==&&tmp[]==){
        return res+;
    }
    //Bob
    if(tmp[]==&&tmp[]==&&tmp[]==){
        return -(res+);
    }
    if(tmp[]==&&tmp[]==&&tmp[]==){
        return -(res+);
    }
    if(tmp[]==&&tmp[]==&&tmp[]==){
        return -(res+);
    }
    if(tmp[]==&&tmp[]==&&tmp[]==){
        return -(res+);
    }
    if(tmp[]==&&tmp[]==&&tmp[]==){
        return -(res+);
    }
    if(tmp[]==&&tmp[]==&&tmp[]==){
        return -(res+);
    }
    if(tmp[]==&&tmp[]==&&tmp[]==){
        return -(res+);
    }
    if(tmp[]==&&tmp[]==&&tmp[]==){
        return -(res+);
    }
    //Tie
    if(res==) return ;
    //None
    return inf;

}

int dfs(int s,int p){
    if(ans[s][p]!=inf) return ans[s][p];
    vector<int> tmp;
    for(int i=;i<;i++) tmp.push_back();
    int ss=s;
    int cnt=;
    while(ss){
        tmp[cnt]=ss%;
        ss/=;
        cnt++;
    }
    int x=judge(tmp);
    if(x!=inf) return ans[s][p]=x;
    if(p==){
        int res=-inf;
        for(int i=;i<;i++){
            if(tmp[i]==){
                res=max(res,dfs(s+*three[i],));
            }
        }
        return ans[s][p]=res;
    }else{
        int res=inf;
        for(int i=;i<;i++){
            if(tmp[i]==){
                res=min(res,dfs(s+*three[i],));
            }
        }
        return ans[s][p]=res;
    }
}
int main(){
    int T;
    scanf("%d",&T);
    pre();
    while(T--){
        for(int i=;i<maxn;i++){
            ans[i][]=ans[i][]=inf;
        }
        for(int i=;i<;i++) scanf("%d",&a[i]);
        int s=;
        for(int i=;i<;i++){
            s+=a[i]*three[i];
        }
        int ans=dfs(s,);
        printf("%d\n",ans);
    }
    return ;
}