The Preliminary Contest for ICPC Asia Shenyang 2019 H. Texas hold'em Poker

题目链接：https://nanti.jisuanke.com/t/41408

题目意思很简单，就是个模拟过程。

---

 #include <iostream>
 #include <cstring>
 #include <algorithm>
 #include <cstdio>
 #include <map>
 #define rep(i,j,k) for(int i = (j); i <= (k); ++i)
 #define per(i,j,k) for(int i = (j); i >= (k); --i)
 #define rep__(i,j,k) for(int i = (j); i < (k); ++i)
 #define per__(i,j,k) for(int i = (j); i > (k); --i)
 #define inf 1e9
 using namespace std;
 typedef long long LL;
 const int N = (int)1e5 + ;

 // map<char,int > mp;
 struct node{
     char name[];
     int card[];
     bool pair;
     int rank_1,rank_2;
     int sum;

     void fun(char* tmp){
         rep__(i,,) card[i] = ;
         rank_1 = rank_2 = ;
         pair = false;
         sum = ;
         int i = ;
         while(tmp[i] != '\0'){
             if(tmp[i] == ''){ //
                 ++card[];
                 i += ;
                 sum += ;//得出卡的总价值
             }
             else{
                 int k = ;
                 if(tmp[i] >= '' && tmp[i] <= '') k = tmp[i] - '' + ;
                 else if(tmp[i] == 'A') k = ;
                 else if(tmp[i] == 'J') k = ;
                 else if(tmp[i] == 'Q') k = ;
                 else if(tmp[i] == 'K') k = ;
                 ++card[k];
                 ++i;
                 sum += k;//得出卡的总价值
             }
         }
     }

     void rank(){
         bool com = true;//没有任何的等级
         //最大的顺子
         if(card[] && card[] && card[] && card[] && card[]){
             rank_1 = ;
             com = false;
         }
         else {
             rep(i,,){
                 if(card[i] == ) rank_1 = ,sum += (-*i + i*),com = false;
                 else if(card[i] == ){
                     //rank_1 == 0 ? rank_1 = 7 : rank_1 = 7,rank_2 = 1;
                     if(rank_1 == ) rank_1 = ;
                     else rank_1 = ,rank_2 = ;
                     sum += (-*i + i*);
                     com = false;
                 }
                 else if(card[i] == ){
                     if(!pair){
                         rank_1 ==  ? rank_1 =  : rank_2 = ;
                         sum += (-*i + i*);
                         pair = ;
                         com = false;
                     }
                     else{
                         rank_2 = ;
                         sum += (-*i + i*);
                     }
                 }
             }
         }
         //都不相同
         if(com){
             rep(i,,){
                 if(i +  > ) break;
                 if(card[i] && card[i + ] && card[i + ] && card[i + ] && card[i + ]){
                     rank_1 = ;
                     break;
                 }
             }
         }
     }

     bool friend operator<(const node& a,const node& b){
         if(a.rank_1 != b.rank_1) return a.rank_1 > b.rank_1;
         else{
             if(a.rank_2 != b.rank_2) return a.rank_2 > b.rank_2;
             else{
                 if(a.sum != b.sum) return a.sum > b.sum;
                 else return strcmp(a.name,b.name) <  ?  : ;
             }
         }
     }
 }stu[N];

 int main(){

     ios::sync_with_stdio(false);
     cin.tie();
     // mp['A'] = 1; 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['J'] = 11; mp['Q'] = 12; mp['K'] = 13;
     int n;
     char tmp[];
     while(cin >> n){

         rep(i,,n){
             cin >> stu[i].name >> tmp;
             stu[i].fun(tmp);//装换成卡片
             stu[i].rank();//等级
         }

         sort(stu + ,stu +  + n);

         rep(i,,n) cout << stu[i].name << endl;
     }

 //    getchar();getchar();
     return ;
 }
 //  << ' ' << stu[i].rank_1 << ' '  << stu[i].rank_2  << ' ' << stu[i].sum 

 /*

 7
 AQ A2345
 AW 58976
 AS 5A397
 AP AAA99
 AL 222AA
 AG AA229
 AU 1010A23
 */