【pb_ds】bzoj1056 [HAOI2008]排名系统/bzoj1862 [Zjoi2006]GameZ游戏排名系统

STL裸题，线下AC，bzoj无限RE ing……

#include<cstdio>
#include<cctype>
#include<iostream>
#include<string>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
int Res,Num;char C,CH[20];
inline int G()
{
    Res=0;C='*'; 
    while(C<'0'||C>'9')C=getchar();
    while(C>='0'&&C<='9'){Res=Res*10+(C-'0');C=getchar();}
    return Res;
}
inline void P(int x)
{
    Num=0;if(!x){putchar('0');puts("");return;}
    while(x>0)CH[++Num]=x%10,x/=10;
    while(Num)putchar(CH[Num--]+48);
    puts("");
}
int n,v,en;
string s;
struct Point
{string x;int y,z;
Point(const string &a,const int &b,const int &c){x=a;y=b;z=c;}
Point(){}};
bool operator < (const Point &a,const Point &b){return a.y!=b.y ? a.y<b.y : a.z>b.z;}
tree<Point,null_type,less<Point>,rb_tree_tag,tree_order_statistics_node_update> T;//在bzoj上请将null_type改成null_mapped_type
typedef tree<Point,null_type,less<Point>,rb_tree_tag,tree_order_statistics_node_update>::iterator ITER;
map<string,int>ma,ma2;
inline bool is_name(const string &x)
{
    int len=x.length();
    for(int i=0;i<len;i++) if(!isalpha(x[i])) return false;
    return true;
}
inline int to_num(const string &x)
{
    int res=0,base=1,len=x.length();
    for(int i=len-1;i>=0;i--)
      {
          res+=(x[i]-'0')*base;
          base*=10;
      }
    return res;
}
int main()
{
    n=G();
    for(int i=1;i<=n;i++)
      {
          cin>>s;
          if(s[0]=='+')
            {
                s.erase(0,1);
                v=G();
                if(ma.find(s)!=ma.end()) T.erase(T.find(Point(s,ma[s],ma2[s])));
            ma[s]=v;
            T.insert(Point(s,v,++en));
            ma2[s]=en;
            }
          else
            {
                s.erase(0,1);
                if(is_name(s)) P(T.size()-T.order_of_key(Point(s,ma[s],ma2[s])));
                else
                  {
                      v=to_num(s);
                      int i=1; ITER it=T.find_by_order(T.size()-v);
                      for(;;it--,i++)
                        {
                            printf("%s",(*it).x.c_str());
                            if(it==T.begin()||i==10)
                      {
                          puts("");
                          break;
                      }
                    putchar(' ');
                        }
                  }
            }
      }
    return 0;
}