bzoj1862/1056: [Zjoi2006]GameZ游戏排名系统

传送门：http://www.lydsy.com/JudgeOnline/problem.php?id=1862

http://www.lydsy.com/JudgeOnline/problem.php?id=1056

【题解】

写到头昏脑涨（逃

写着写着发现不仅要记录权值和哈希值还需要记录插入时间，于是强行开了两个map来映射哈希值->权值，哈希值->插入时间

好像常数很大的样子但是跑的挺快呀。。

记住无论什么操作，都要splay到根，包括询问，因为可以构造一直询问的来卡复杂度。

好像就行了。。先放这份map的吧

# include <map>
# include <stdio.h>
# include <string.h>
# include <iostream>
# include <algorithm>
// # include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int M = 5e5 + ;
const int mod = 1e9+;

struct pa {
    int v; ull h;
    pa() {}
    pa(int v, ull h) : v(v), h(h) {}
    friend bool operator == (pa a, pa b) {
        return a.v == b.v && a.h == b.h;
    }
};

int total, ind = , tid = ;
map<ull, int> mp, tim;

char fys[M][];
char str[];
ull bin[];

struct Splay {
    int ch[M][], sz[M], fa[M], tm[M], siz, rt;
    pa val[M];
    int re[M], rn;

    inline void set() {
        siz = rn = ;
    }

    inline int newnode() {
        int x = rn ? re[rn--] : (++siz);
        fa[x] = ch[x][] = ch[x][] = , sz[x] = ; tm[x] = ;
        return x;
    }

    inline void up(int x) {
        if(!x) return ;
        sz[x] =  + sz[ch[x][]] + sz[ch[x][]];
    }

    inline void rotate(int x, int &rt) {
        int y = fa[x], z = fa[y], ls = ch[y][] == x, rs = ls^;
        if(y == rt) rt = x;
        else ch[z][ch[z][] == y] = x;
        fa[ch[x][rs]] = y, fa[y] = x, fa[x] = z;
        ch[y][ls] = ch[x][rs]; ch[x][rs] = y;
        up(y), up(x);
    }

    inline void splay(int x, int &rt) {
        while(x != rt) {
            int y = fa[x], z = fa[y];
            if(y != rt) {
                if((ch[z][] == y)^(ch[y][] == x)) rotate(x, rt);
                else rotate(y, rt);
            }
            rotate(x, rt);
        }
    }

    inline bool cmp(pa t, pa p) {
        return t.v > p.v;
    }

    inline void ins(pa t, int tt) {
        int x = rt, y, te;
        while() {
            te = cmp(t, val[x]);
            y = ch[x][te];
            if(!y) {
                y = newnode();
                val[y] = t; tm[y] = tt;
                fa[y] = x; ch[x][te] = y;
                break;
            }
            x = y;
        }
        splay(x, rt);
    }

    inline int find(int x, int rk) {
        if(sz[ch[x][]] +  == rk) return x;
        if(sz[ch[x][]] +  < rk) return find(ch[x][], rk - sz[ch[x][]] - );
        else return find(ch[x][], rk);
    }

    inline int find(int x, pa t, int tt) {
        if(t.v == val[x].v && tt == tm[x]) return x;
        if(t.v < val[x].v || (t.v == val[x].v && tt > tm[x])) return find(ch[x][], t, tt);
        else return find(ch[x][], t, tt);
    }

    inline int gmax(int x) {
        while(ch[x][]) x = ch[x][];
        return x;
    }

    inline int gmin(int x) {
        while(ch[x][]) x = ch[x][];
        return x;
    }

    inline void del(pa t) {
        int x = find(rt, t, tim[t.h]);
        splay(x, rt);
        int pre = gmax(ch[x][]), nxt = gmin(ch[x][]);
        splay(pre, rt); splay(nxt, ch[pre][]);
        ch[nxt][] = , fa[x] = ; ch[x][] = ch[x][] = ; tm[x] = ;
        re[++rn] = x;                 // reuse
    }

    inline void INS(pa t) {
        int tt = tim[t.h];
        if(mp.count(t.h)) {
            int tv = mp[t.h];
            del(pa(tv, t.h));
        } else ++total;
        tim[t.h] = ++tid;
        for (int i=; str[i]; ++i) fys[tid][i-] = str[i];
        ins(t, tim[t.h]); mp[t.h] = t.v;
    }

    inline int findrk(int x, pa t, int tt) {
        if(t.v == val[x].v && tt == tm[x]) return sz[ch[x][]] + ;
        if(t.v < val[x].v || (t.v == val[x].v && tt > tm[x])) return findrk(ch[x][], t, tt);
        else return sz[ch[x][]] +  + findrk(ch[x][], t, tt);
    }

    inline int RANK(ull h) {
        pa t = pa(mp[h], h); int tt = tim[h];
        int ret = findrk(rt, t, tt);
        int p = find(rt, t, tt); splay(p, rt);
        return total - ret;
    }

    bool fir;
    inline void prt(int x) {
        if(!x) return;
        prt(ch[x][]);
        if(fir) fir = ;
        else printf(" ");
//        cout << val[x].h << endl;
        printf("%s", fys[tm[x]]);
        prt(ch[x][]);
    }

    inline int PRT(int rk) {
        int ed = total - rk;
        rk = total - rk - min(, total -  - rk) + ;// cout << "rk = " << rk << endl;
//        debug(rt);
        int x = find(rt, rk - ), y = find(rt, ed + );// cout << x << ' ' << y << endl;
        splay(x, rt); splay(y, ch[x][]);
        fir = ; prt(ch[y][]); puts("");
    }

    inline void debug(int x) {
        if(!x) return ;
        debug(ch[x][]);
        cout << "x = " << x << ", fa = " << fa[x] << ", ls = " << ch[x][] << ", rs = " << ch[x][] << ", val = {" << val[x].v << ", " << val[x].h << "}, sz = " << sz[x] << ", tm = " << tm[x] << endl;
        debug(ch[x][]);
    }

}T;

inline ull ghash(char *t) {
    ull ret = ;
    for (int i=; t[i]; ++i)
        ret = ret + (t[i] - 'A' + ) * bin[i];
    return ret;
}

inline int toint(char *t) {
    int ret = ;
    for (int i=; t[i]; ++i)
        ret = ret *  + t[i] - '';
    return ret;
}

int main() {
    bin[] = ;
    for (int i=; i<=; ++i) bin[i] = bin[i-] * ;
    int Q, v; cin >> Q;
    T.set(); total = ;
    // insert v
    T.siz = ; T.rt = ;
    T.ch[][] = T.ch[][] = T.ch[][] = ; T.fa[] = ;
    T.val[] = pa(-, ), T.val[] = pa(, );
    T.ch[][] = ; T.fa[] = ; T.sz[] = , T.sz[] = ;
    while(Q--) {
        scanf("%s", &str);
        if(str[] == '+') {
            scanf("%d", &v);
            ull ha = ghash(str+);
            T.INS(pa(v, ha));
        } else {
            if(isdigit(str[])) T.PRT(toint(str+));
            else printf("%d\n", T.RANK(ghash(str+)));
        }
    }
    return ;
}
/*
20
+ADAM 1000000
+BOB 1000000
+TOM 2000000
+CATHY 10000000
?TOM
?1
+DAM 100000
+BOB 1200000
+ADAM 900000
+FRANK 12340000
+LEO 9000000
+KAINE 9000000
+GRACE 8000000
+WALT 9000000
+SANDY 8000000
+MICK 9000000
+JACK 7320000
?2
?5
?KAINE
*/

upd: 写了个哈希表，本地跑得贼快

# include <stdio.h>
# include <string.h>
# include <iostream>
# include <algorithm>
// # include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int M = 2.5e5 + , N = 2.5e5 + ;
const int mod = ;

struct pa {
    int v, h;
    pa() {}
    pa(int v, int h) : v(v), h(h) {}
    friend bool operator == (pa a, pa b) {
        return a.v == b.v && a.h == b.h;
    }
};

int total, tid = ;

char str[];

int head[mod + ], nxt[N], to[N], w[N], tot = ;
char tch[N][];
inline void add(int u, int v, int tw, char *str) {
    ++tot; nxt[tot] = head[u]; head[u] = tot; to[tot] = v;
    for (int i=; str[i]; ++i) tch[tot][i] = str[i];
    w[tot] = tw;
}

struct Splay {
    int ch[M][], sz[M], fa[M], tm[M], siz, rt;
    pa val[M];
    int re[M], rn;

    inline void set() {
        siz = rn = ;
    }

    inline int newnode() {
        int x = rn ? re[rn--] : (++siz);
        fa[x] = ch[x][] = ch[x][] = , sz[x] = ; tm[x] = ;
        return x;
    }

    inline void up(int x) {
        if(!x) return ;
        sz[x] =  + sz[ch[x][]] + sz[ch[x][]];
    }

    inline void rotate(int x, int &rt) {
        int y = fa[x], z = fa[y], ls = ch[y][] == x, rs = ls^;
        if(y == rt) rt = x;
        else ch[z][ch[z][] == y] = x;
        fa[ch[x][rs]] = y, fa[y] = x, fa[x] = z;
        ch[y][ls] = ch[x][rs]; ch[x][rs] = y;
        up(y), up(x);
    }

    inline void splay(int x, int &rt) {
        while(x != rt) {
            int y = fa[x], z = fa[y];
            if(y != rt) {
                if((ch[z][] == y)^(ch[y][] == x)) rotate(x, rt);
                else rotate(y, rt);
            }
            rotate(x, rt);
        }
    }

    inline bool cmp(pa t, pa p) {
        return t.v > p.v;
    }

    inline void ins(pa t, int tt) {
        int x = rt, y, te;
        while() {
            te = cmp(t, val[x]);
            y = ch[x][te];
            if(!y) {
                y = newnode();
                val[y] = t; tm[y] = tt;
                fa[y] = x; ch[x][te] = y;
                break;
            }
            x = y;
        }
        splay(x, rt);
    }

    inline int find(int x, int rk) {
        if(sz[ch[x][]] +  == rk) return x;
        if(sz[ch[x][]] +  < rk) return find(ch[x][], rk - sz[ch[x][]] - );
        else return find(ch[x][], rk);
    }

    inline int find(int x, pa t, int tt) {
        if(t.v == val[x].v && tt == tm[x]) return x;
        if(t.v < val[x].v || (t.v == val[x].v && tt > tm[x])) return find(ch[x][], t, tt);
        else return find(ch[x][], t, tt);
    }

    inline int gmax(int x) {
        while(ch[x][]) x = ch[x][];
        return x;
    }

    inline int gmin(int x) {
        while(ch[x][]) x = ch[x][];
        return x;
    }

    inline void del(pa t, int tim) {
        int x = find(rt, t, tim);
        splay(x, rt);
        int pre = gmax(ch[x][]), nxt = gmin(ch[x][]);
        splay(pre, rt); splay(nxt, ch[pre][]);
        ch[nxt][] = , fa[x] = ; ch[x][] = ch[x][] = ; tm[x] = ;
        re[++rn] = x;                 // reuse
    }

    inline void INS(pa t) {
        int tim = -, tv, id = -;
        for (int i=head[t.h]; i; i=nxt[i])
            if(strcmp(tch[i], str+) == ) {
                tim = to[i]; tv = w[i]; id = i;
                break;
            }
        if(id != -) del(pa(tv, t.h), tim);
        else ++total;
        ++tid; tim = tid;
        if(id != -) {
            to[id] = tim;
            w[id] = t.v;
        } else add(t.h, tim, t.v, str+);
        ins(t, tim);
    }

    inline int findrk(int x, pa t, int tt) {
        if(t.v == val[x].v && tt == tm[x]) return sz[ch[x][]] + ;
        if(t.v < val[x].v || (t.v == val[x].v && tt > tm[x])) return findrk(ch[x][], t, tt);
        else return sz[ch[x][]] +  + findrk(ch[x][], t, tt);
    }

    inline int RANK(int h) {
        int tt, tv;
        for (int i=head[h]; i; i=nxt[i])
            if(strcmp(tch[i], str+) == ) {
                tt = to[i]; tv = w[i];
                break;
            }
        pa t = pa(tv, h);
        int ret = findrk(rt, t, tt), x = find(rt, t, tt); splay(x, rt);
        return total - ret;
    }

    bool fir;
    inline void prt(int x) {
        if(!x) return;
        prt(ch[x][]);
        if(fir) fir = ;
        else printf(" ");
//        cout << val[x].h << endl;
        for (int i=head[val[x].h]; i; i=nxt[i])
            if(to[i] == tm[x]) { printf("%s", tch[i]); break; }
        prt(ch[x][]);
    }

    inline int PRT(int rk) {
        int ed = total - rk;
        rk = total - rk - min(, total -  - rk) + ;// cout << "rk = " << rk << endl;
//        debug(rt);
        int x = find(rt, rk - ), y = find(rt, ed + );// cout << x << ' ' << y << endl;
        splay(x, rt); splay(y, ch[x][]);
        fir = ; prt(ch[y][]); puts("");
    }

    inline void debug(int x) {
        if(!x) return ;
        debug(ch[x][]);
        cout << "x = " << x << ", fa = " << fa[x] << ", ls = " << ch[x][] << ", rs = " << ch[x][] << ", val = {" << val[x].v << ", " << val[x].h << "}, sz = " << sz[x] << ", tm = " << tm[x] << endl;
        debug(ch[x][]);
    }

}T;

inline int ghash(char *t) {
    int ret = ;
    for (int i=; t[i]; ++i)
        ret = 1ll * ret *  % mod + t[i] - 'A';
    return ret % mod;
}

inline int toint(char *t) {
    int ret = ;
    for (int i=; t[i]; ++i)
        ret = ret *  + t[i] - '';
    return ret;
}

int main() {
//    freopen("rank7.in", "r", stdin);
//    freopen("rank7-my.out", "w", stdout);
    int Q, v; cin >> Q;
    T.set(); total = ;
    // insert v
    T.siz = ; T.rt = ;
    T.ch[][] = T.ch[][] = T.ch[][] = ; T.fa[] = ;
    T.val[] = pa(-, ), T.val[] = pa(, );
    T.ch[][] = ; T.fa[] = ; T.sz[] = , T.sz[] = ;
    while(Q--) {
        scanf("%s", &str);
        if(str[] == '+') {
            scanf("%d", &v);
            T.INS(pa(v, ghash(str+)));
        } else {
            if(isdigit(str[])) T.PRT(toint(str+));
            else printf("%d\n", T.RANK(ghash(str+)));
        }
    }
    return ;
}
/*
20
+ADAM 1000000
+BOB 1000000
+TOM 2000000
+CATHY 10000000
?TOM
?1
+DAM 100000
+BOB 1200000
+ADAM 900000
+FRANK 12340000
+LEO 9000000
+KAINE 9000000
+GRACE 8000000
+WALT 9000000
+SANDY 8000000
+MICK 9000000
+JACK 7320000
?2
?5
?KAINE
*/