Gym 103186L 高低奥马哈扑克（大模拟）

思路

大模拟没啥好说的，有两个坑点 第一个是 A2345和10JQKA 都是顺子。A2345是最小的顺子。同时对于其他牌型A的权值相当于14。干就完了。这种大模拟除了自己和神没人看的懂的 。所以附上代码可以跑一些数据作为debug。

#include<bits/stdc++.h>
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define nep(i,r,l) for(int i=r;i>=l;i--)
#define x first
#define y second
using namespace std;
const int N=5005;
typedef long long ll;

vector<pair<int,int> > Alice;
vector<pair<int,int> > Bob;
vector<pair<int,int> > Gong;
ll mmm=0x3f3f3f3f3f3f;
ll mmm2=0x3f3f3f3f3f3f;

bool cmp(pair<int,int> a,pair<int,int>b)
{
	return a.x<b.x;
}
bool judge2(vector<pair<int,int> > v)
{
    rep(i,1,4)
	{
	    if(v[i].x==14) v[i].x=1;
	}
    sort(v.begin(),v.end(),cmp);
	if(v[0].x>8) return false;
	rep(i,1,4)
	{
		if(v[i].x>8) return false;
		if(v[i].x==v[i-1].x) return false;
	}
	return true;
}
ll sitiao(vector<pair<int,int> > v ){
	ll tsum=0;
	int len= v.size();
	rep(i,0,1){
		if(v[i].x==v[i+1].x&&v[i].x==v[i+2].x&&v[i].x==v[i+3].x)
		{
			if(i==0){
				tsum+=v[0].x*100;
				tsum+=v[4].x;
			}
			else
			{
				tsum+=v[1].x*100;
				tsum+=v[0].x;
			}
			return tsum;
		}
	}
	return 0;
}
ll hulu(vector<pair<int,int> > v ){
	ll tsum=0;
	if(v[0].x==v[1].x&&v[2].x==v[3].x&&v[2].x==v[4].x)
	{
		tsum+=v[2].x*100;
		tsum+=v[1].x;
		return tsum;
	}
	if(v[0].x==v[1].x&&v[0].x==v[2].x&&v[3].x==v[4].x)
	{
		tsum+=v[1].x*100;
		tsum+=v[3].x;
		return tsum;
	}
	return 0;
}
ll tonghua(vector<pair<int,int> > v ){
	int len= v.size();
	rep(i,1,len-1) if(v[i].y!=v[i-1].y) return 0;
	ll tsum=0;
    nep(i,4,0)
        tsum=tsum*100+v[i].x;
	return tsum;
}
ll shunzi(vector<pair<int,int> > v ){
	int len=v.size();
	if(v[4].x==14&&v[3].x==13&&v[2].x==12&&v[1].x==11&&v[0].x==10)
    {
        return 14;
    }
	if(v[4].x==14&&v[3].x==5&&v[2].x==4&&v[1].x==3&&v[0].x==2)
    {
        return 5;
    }
	rep(i,1,len-1) if(v[i].x!=v[i-1].x+1) return 0;
	return v[4].x;
}
ll santiao(vector<pair<int,int> > v ){
	ll tsum=0;
	int len= v.size();
	rep(i,0,2){
		if(v[i].x==v[i+1].x&&v[i].x==v[i+2].x)
		{
		    tsum=tsum*100+v[i].x;
		    nep(j,4,0)
		    {
		        if(j!=i&&j!=i+1&&j!=i+2)
                {
                    tsum=tsum*100+v[j].x;
                }
		    }
			//cout<<"santiao"<<tsum<<endl;
			return tsum;
		}
	}
	return 0;

}
ll liangdui(vector<pair<int,int> >v ){
	vector<int> sanv;
	ll tsum=0;
	int len= v.size();
	rep(i,1,len-1) if(v[i].x==v[i-1].x) sanv.push_back(v[i].x);
	if(sanv.size()==2)
	{
		tsum+=sanv[1]*100;
		tsum+=sanv[0];
		nep(i,4,0)
		{
		    if(v[i].x!=sanv[0]&&v[i].x!=sanv[1])
            {
                tsum+=tsum*100+v[i].x;
            }
		}
		return tsum;
	}
	else return 0;
}
int yidui(vector<pair<int,int> > v){
	int len= v.size();
	rep(i,1,len-1) if(v[i].x==v[i-1].x)
	{
	    ll tsum=v[i].x;
        nep(j,4,0)
        if(j!=i&&j!=i-1)
            tsum=tsum*100+v[j].x;

	    return tsum;
	}
	return 0;
}
int tonghuashun(vector<pair<int,int> > v){
	int len= v.size();
	if(tonghua(v)&&shunzi(v)) return shunzi(v);
	return 0;
}

pair<int,ll> judge(vector<pair<int,int> > v){
	if(tonghuashun(v)) return {1,tonghuashun(v)};
	if(sitiao(v)) return {2,sitiao(v)};
	if(hulu(v)) return {3,hulu(v)};
	if(tonghua(v)) return {4,tonghua(v)};
	if(shunzi(v)) return {5,shunzi(v)};
	if(santiao(v)) return {6,santiao(v)};
	if(liangdui(v)) return {7,liangdui(v)};
	if(yidui(v)) return {8,yidui(v)};
    ll tsum=0;
    nep(i,4,0)
        tsum=tsum*100+v[i].x;
	return {9,tsum};
}

pair<pair<int,ll>,pair<int,ll>> dfs1()
{
	pair<int,ll> opt={9,0};
	pair<int,ll> opt2={9,0};
	vector<pair<int,int> > ans;
	vector<pair<int,int> > ans2;
	rep(i,0,4){
		ans.push_back(Gong[i]);
		ans2.push_back(Gong[i]);
		rep(j,i+1,4){
			ans.push_back(Gong[j]);
			ans2.push_back(Gong[j]);
			rep(k,j+1,4)
			{
				ans.push_back(Gong[k]);
				ans2.push_back(Gong[k]);
				rep(q,0,3)
				{
					ans.push_back(Alice[q]);
					ans2.push_back(Bob[q]);
					rep(w,q+1,3)
					{
						ans.push_back(Alice[w]);
						ans2.push_back(Bob[w]);
						vector<pair<int,int> > v;
						vector<pair<int,int> > v2;
						rep(l,0,4) v.push_back(ans[l]);
						rep(l,0,4) v2.push_back(ans2[l]);
						sort(v.begin(),v.end(),cmp);
						sort(v2.begin(),v2.end(),cmp);

						pair<int,ll> ooo=judge(v);
						pair<int,ll> ooo2=judge(v2);
//						rep(i,0,4) cout<<v[i].x<<" ";
                        //cout<<ooo2.x<<" "<<ooo2.y<<endl;
                        rep(i,0,4)
                        {
                            if(v[i].x==14) v[i].x=1;
                            if(v2[i].x==14) v2[i].x=1;
                        }
                        sort(v.begin(),v.end(),cmp);
						sort(v2.begin(),v2.end(),cmp);
                        if(judge2(v))
                        {
                            ll tsum=0;
                            nep(i,4,0)
                            {
                                tsum=tsum*100+v[i].x;

                            }
                            mmm=min(mmm,tsum);
                        }
                        if(judge2(v2))
                        {
                            ll tsum=0;
                            nep(i,4,0)
                            {
                                tsum=tsum*100+v2[i].x;

                            }
                            mmm2=min(mmm2,tsum);
                        }

						if(ooo.x<opt.x)
							opt=ooo;
						else if(ooo.x==opt.x&&ooo.y>opt.y)
                            opt=ooo;
						if(ooo2.x<opt2.x)
                            opt2=ooo2;
						else if(ooo2.x==opt2.x&&ooo2.y>opt2.y)
                        {
                            opt2=ooo2;
                        }
						ans.pop_back();
						ans2.pop_back();
					}
					ans.pop_back();
					ans2.pop_back();
				}
				ans.pop_back();
				ans2.pop_back();
			}
			ans.pop_back();
			ans2.pop_back();
		}
		ans.pop_back();
		ans2.pop_back();
	}
	ans.pop_back();
	ans2.pop_back();

	return make_pair(opt,opt2);
}

int main()
{
//    freopen("in.txt","r",stdin);
//    freopen("my.txt","w",stdout);
    //cout<<floor(5/2);
	map<char,int> mp;
	mp['A']=14;
	mp['2']=2;
	mp['3']=3;
	mp['4']=4;
	mp['5']=5;
	mp['6']=6;
	mp['7']=7;
	mp['8']=8;
	mp['9']=9;
	mp['T']=10;
	mp['J']=11;
	mp['K']=13;
	mp['Q']=12;
	map<char,int> mp1;
	mp1['C']=1;
	mp1['D']=2;
	mp1['S']=3;
	mp1['H']=4;
	int t;cin>>t;
	while(t--)
	{
	    Alice.clear();
        Bob.clear();
        Gong.clear();
        mmm=0x3f3f3f3f3f3f;
        mmm2=0x3f3f3f3f3f3f;
		int ans;
		cin>>ans;
		char ch1,ch2;
		rep(i,0,3)
		{
			cin>>ch1>>ch2;
			Alice.push_back({mp[ch1],mp1[ch2]});
		}
		rep(i,0,3)
		{
			cin>>ch1>>ch2;
			Bob.push_back({mp[ch1],mp1[ch2]});
		}
		rep(i,0,4)
		{
			cin>>ch1>>ch2;
			Gong.push_back({mp[ch1],mp1[ch2]});
		}
        int the_a=0,the_b=0;
		pair<pair<int,ll>,pair<int,ll>> tp=dfs1();
		int tm=(ans+1)/2;
		int ts=(ans)/2;
		if(tp.x.x==tp.y.x&&tp.x.y==tp.y.y)
        {
            if(mmm==mmm2)
            {
                if(mmm==0x3f3f3f3f3f3f)
                {
                    the_a=tm;
                    the_b=ts;
                }
                else{
                    the_a=(tm+1)/2+(ts+1)/2;the_b=ans-the_a;
                }
            }
            else if(mmm<mmm2)
            {
                the_b=tm/2;
                the_a=ans-the_b;
            }
            else
            {
                the_a=(tm+1)/2;
                the_b=ans-the_a;
            }

        }
        else if((tp.x.x<tp.y.x||(tp.x.x==tp.y.x&&tp.x.y>tp.y.y)))
        {
            if(mmm2==0x3f3f3f3f3f3f||mmm<mmm2) the_a=ans;
            else if(mmm2==mmm){the_a=tm+(ts+1)/2;the_b=ts/2;}
            else {the_a=tm;the_b=ts;}
        }
        else if((tp.x.x>tp.y.x||(tp.x.x==tp.y.x&&tp.x.y<tp.y.y)))
        {
            if(mmm==0x3f3f3f3f3f3f||mmm>mmm2) the_b=ans;
            else if(mmm2==mmm){the_b=tm+(ts)/2;the_a=(ts+1)/2;}
            else {the_b=tm;the_a=ts;}
        }
//
//        cout<<tp.x.x<<" "<<tp.y.x<<"   "<<tp.x.y<<" "<<tp.y.y<<endl;
//        cout<<mmm<<" "<<mmm2<<endl;
        cout<<the_a<<" "<<the_b<<endl;
//        cout<<"-------------------"<<endl;
//		cout<<tp.x<<" "<<tp.y<<endl;
//		rep(i,0,4) cout<<big1[i].x<<" ";
//		cout<<endl;
//		cout<<santiao(big1)<<endl;
		//rep(i,0,3) cout<<Alice[i].first<<" "<<Alice[i].second<<endl;
	}
	return 0;
}
/*
4
233
3S 2H 6S 7C
2C TS 3H QS
3C 3D 2C 2D AC
233
3S 5H 6S 7C
2C TS JH QS
3C 3D 2C 2D AC
233
3S 4H 5S 7C
2C TS JH QS
3C 3D 2C 2D AC
233
AS AH 2S 2C
AC AS 2H 2S
4C 4D 5C 5D 6C
*/