hdu 5017

好恶心的题

#include <cstdio>
#include <string.h>
#include <algorithm>
#include <cmath>
#include <set>
using namespace std;
typedef __int64 ll;
struct point{
   ll word,priori;
}P[];
char T[][]={ {"Add"},{"Close"},{"Chat"},{"Rotate"},{"Prior"},{"Choose"},{"Top"},{"Untop"}};
int sz,op,always=-;
void per(int x){
    point ttt = P[x];
    for(int i=x; i>; --i)
        P[i]=P[i-];
    P[]=ttt;
}
void last(int x){
    point ttt= P[x];
    for(int i=x; i<sz-; ++i)
    P[i]=P[i+];
    P[sz-]=ttt;
}
void solve0(){
     ll id;
     scanf("%I64d",&id);
     int loc=-;
     for(int i=; i<sz; ++i)
     if( P[i].priori == id ){
           loc=i; break;
     }
     if( loc == - ){
         P[sz].word=;
         P[sz].priori=id;
         sz++;
         printf("Operation #%d: success.\n",op++);
     }else{
         printf("Operation #%d: same priority.\n",op++);
     }
}
void solve1(){
    ll id;
    scanf("%I64d",&id);
    int loc=-;
    for(int i=; i<sz; ++i)
         if(P[i].priori==id){
            loc=i; break;
         }
    if(loc==-){
         printf("Operation #%d: invalid priority.\n",op++);
    }else {
        printf("Operation #%d: close %I64d with %I64d.\n",op++,P[loc].priori,P[loc].word);
        if(P[loc].priori==always) always=-;
        for(int i=loc+; i<sz; ++i)
             P[i-]=P[i];
        sz--;
    }
}
void solve2(){
   ll id;
   scanf("%I64d",&id);
   if(sz==){ ///*****************************
      printf("Operation #%d: empty.\n",op++);
   }else{
      if(always!=-){
            for(int i=; i<sz; ++i)
            if(P[i].priori==always){
                 P[i].word+=id; break;
            }
      }else P[].word+= id;
      printf("Operation #%d: success.\n",op++);
   }
}
void solve3(){
    ll id;
    scanf("%I64d",&id);
    id--;
    if( id< || id >= sz){
         printf("Operation #%d: out of range.\n",op++);
    }else{
             point ttt=P[id];
             for(int i=id; i>; --i)
                P[i]=P[i-];
             P[]=ttt;
             printf("Operation #%d: success.\n",op++);
    }
}
void solve4(){
    if(sz==){
        printf("Operation #%d: empty.\n",op++);
    }else{
        int loc=;
        ll hi=-;
        for(int i=; i<sz; ++i)
            if(P[i].priori>hi) hi=P[i].priori,loc=i;
             point ttt=P[loc];
             for(int i=loc; i>; --i)
                P[i]=P[i-];
                P[]=ttt;
         printf("Operation #%d: success.\n",op++);
    }
}
void solve5(){
     ll id;
     scanf("%I64d",&id);
     int loc=-;
     for(int i=; i<sz; ++i)
     if(P[i].priori==id){
         loc=i; break;
     }
     if(loc==-){
         printf("Operation #%d: invalid priority.\n",op++); return;
     }
             point ttt=P[ loc ];
             for(int i=loc; i>; --i)
                P[i]=P[i-];
                P[]=ttt;
         printf("Operation #%d: success.\n",op++);
}
void solve6(){
      ll id;
      scanf("%I64d",&id);
      int loc=-;
      for(int i=; i<sz; ++i)
         if(P[i].priori==id){
            loc=i; break;
         }
      if(loc==-){
         printf("Operation #%d: invalid priority.\n",op++); return;
      }
      always=id;
      printf("Operation #%d: success.\n",op++);
}
void solve7(){
      if(always==-){
          printf("Operation #%d: no such person.\n",op++); return;
      }
      always=-;
      printf("Operation #%d: success.\n",op++);
}
int main(){

    int cas;
    scanf("%d",&cas);
     char str[];
     for(int cc= ; cc<=cas; ++cc){
            int n;
            scanf("%d",&n);
            always=-;
            sz=;op=;
            for(int i=; i<n; ++i){
                 scanf("%s",str);
                 if(strcmp(str,T[])==) solve0();
                 else if(strcmp(str,T[])==) solve1();
                 else if(strcmp(str,T[])==) solve2();
                 else if(strcmp(str,T[])==) solve3();
                 else if(strcmp(str,T[])==) solve4();
                 else if(strcmp(str,T[])==) solve5();
                 else if(strcmp(str,T[])==) solve6();
                 else if(strcmp(str,T[])==) solve7();
                // printf(".\n");
             }
             if(always!=-){
                 for(int i=; i<sz; ++i)
                 if(P[i].priori==always&&P[i].word!=){
                    printf("Bye %I64d: %I64d\n",P[i].priori,P[i].word); break;
                 }
             }
            for(int i=; i<sz; ++i)
              if(P[i].priori!=always&&P[i].word!=){
                     printf("Bye %I64d: %I64d\n",P[i].priori,P[i].word);
            }

     }
  return ;
}