【HDOJ】4605 Magic Ball Game

思路1：
树状数组+离线处理，对所有的w离散化处理，边dfs边使用树状数组更新左右w的情况。
思路2：
主席树，边bfs边建树。结点信息存储cnt，然后在线查询。
树状数组。

 /* 4605 */
 #include <iostream>
 #include <sstream>
 #include <string>
 #include <map>
 #include <queue>
 #include <set>
 #include <stack>
 #include <vector>
 #include <deque>
 #include <algorithm>
 #include <cstdio>
 #include <cmath>
 #include <ctime>
 #include <cstring>
 #include <climits>
 #include <cctype>
 #include <cassert>
 #include <functional>
 #include <iterator>
 #include <iomanip>
 using namespace std;
 //#pragma comment(linker,"/STACK:102400000,1024000")

 #define sti                set<int>
 #define stpii            set<pair<int, int> >
 #define mpii            map<int,int>
 #define vi                vector<int>
 #define pii                pair<int,int>
 #define vpii            vector<pair<int,int> >
 #define rep(i, a, n)     for (int i=a;i<n;++i)
 #define per(i, a, n)     for (int i=n-1;i>=a;--i)
 #define clr                clear
 #define pb                 push_back
 #define mp                 make_pair
 #define fir                first
 #define sec                second
 #define all(x)             (x).begin(),(x).end()
 #define SZ(x)             ((int)(x).size())
 #define lson            l, mid, rt<<1
 #define rson            mid+1, r, rt<<1|1

 typedef struct ques_t {
     int w, id;

     ques_t() {}
     ques_t(int w, int id):
         w(w), id(id) {}

 } ques_t;

 const int maxn = 1e5+;
 const int maxm = maxn * ;
 int a[maxm];
 int W[maxn];
 ques_t Q[maxn];
 vector<ques_t> vc[maxn];
 int ans[maxn][];
 int son[maxn][];
 int tot[maxm][];
 int n, m;

 int lowest(int x) {
     return x & -x;
 }

 void add(int x, int delta, int id) {
     while (x <= m) {
         tot[x][id] += delta;
         x += lowest(x);
     }
 }

 int sum(int x, int id) {
     int ret = ;

     while (x) {
         ret += tot[x][id];
         x -= lowest(x);
     }

     return ret;
 }

 void init() {
     memset(son, , sizeof(son));
     memset(tot, , sizeof(tot));
     rep(i, , n+)
         vc[i].clr();
     m = ;
 }

 void dfs(int u, int tot) {
     int v, sz = SZ(vc[u]);
     int llt, lgt, rlt, rgt;
     int eq;

     rep(i, , sz) {
         int w = vc[u][i].w;
         int id = vc[u][i].id;
         llt = sum(w-, );
         lgt = sum(m, ) - sum(w, );
         rlt = sum(w-, );
         rgt = sum(m, ) - sum(w, );
         eq = tot - llt - lgt - rlt - rgt;
         if (eq) {
             ans[id][] = -;
         } else {
             ans[id][] = (lgt+rgt) + (llt+rlt)*;
             ans[id][] = rlt;
         }
     }
     if (son[u][]) {
         add(W[u], , );
         dfs(son[u][], tot+);
         add(W[u], -, );

         add(W[u], , );
         dfs(son[u][], tot+);
         add(W[u], -, );
     }
 }

 void solve() {
     int q;
     int x, w;

     scanf("%d", &q);
     rep(i, , q) {
         scanf("%d %d", &Q[i].id, &Q[i].w);
         a[m++] = Q[i].w;
     }

     sort(a+, a+m);
     m = unique(a+, a+m) - (a+);

     rep(i, , n+) {
         W[i] = lower_bound(a+, a++m, W[i]) - a;
     }

     rep(i, , q) {
         int u = Q[i].id;
         w = lower_bound(a+, a++m, Q[i].w) - a;
         vc[u].pb(ques_t(w, i));
     }

     dfs(, );

     rep(i, , q) {
         if (ans[i][] == -)
             puts("");
         else
             printf("%d %d\n", ans[i][], ans[i][]);
     }
 }

 int main() {
     ios::sync_with_stdio(false);
     #ifndef ONLINE_JUDGE
         freopen("data.in", "r", stdin);
         freopen("data.out", "w", stdout);
     #endif

     int t;
     int u, v1, v2;

     scanf("%d", &t);
     while (t--) {
         init();
         scanf("%d", &n);
         rep(i, , n+) {
             scanf("%d", &W[i]);
             a[m++] = W[i];
         }
         int k;
         scanf("%d", &k);
         rep(i, , k) {
             scanf("%d %d %d", &u, &v1, &v2);
             son[u][] = v1;
             son[u][] = v2;
         }
         solve();
     }

     #ifndef ONLINE_JUDGE
         printf("time = %d.\n", (int)clock());
     #endif

     return ;
 }

主席树。

 /* 4605 */
 #include <iostream>
 #include <sstream>
 #include <string>
 #include <map>
 #include <queue>
 #include <set>
 #include <stack>
 #include <vector>
 #include <deque>
 #include <algorithm>
 #include <cstdio>
 #include <cmath>
 #include <ctime>
 #include <cstring>
 #include <climits>
 #include <cctype>
 #include <cassert>
 #include <functional>
 #include <iterator>
 #include <iomanip>
 using namespace std;
 //#pragma comment(linker,"/STACK:102400000,1024000")

 #define sti                set<int>
 #define stpii            set<pair<int, int> >
 #define mpii            map<int,int>
 #define vi                vector<int>
 #define pii                pair<int,int>
 #define vpii            vector<pair<int,int> >
 #define rep(i, a, n)     for (int i=a;i<n;++i)
 #define per(i, a, n)     for (int i=n-1;i>=a;--i)
 #define clr                clear
 #define pb                 push_back
 #define mp                 make_pair
 #define fir                first
 #define sec                second
 #define all(x)             (x).begin(),(x).end()
 #define SZ(x)             ((int)(x).size())
 // #define lson            l, mid, rt<<1
 // #define rson            mid+1, r, rt<<1|1

 const int INF = 1e9+;
 const int maxn = 1e5+;
 const int maxm = maxn * ;
 int a[maxn], W[maxn];
 int T[maxn];
 int lson[maxm], rson[maxm];
 int lc[maxm], rc[maxm];
 int n, m, tot;
 int son[maxn][];

 void init() {
     tot = m = ;
     memset(son, , sizeof(son));
 }

 int Build(int l, int r) {
     int rt = tot++;

     lc[rt] = rc[rt] = ;

     if (l == r)
         return rt;

     int mid = (l + r) >> ;

     lson[rt] = Build(l, mid);
     rson[rt] = Build(mid+, r);

     return rt;
 }

 int Insert(int rt, int p, int lval, int rval) {
     int nrt = tot++, ret = nrt;
     int l = , r = m - , mid;

     lc[nrt] = lc[rt] + lval;
     rc[nrt] = rc[rt] + rval;
     while (l < r) {
         mid = (l + r) >> ;
         if (p <= mid) {
             lson[nrt] = tot++;
             rson[nrt] = rson[rt];
             nrt = lson[nrt];
             rt = lson[rt];
             r = mid;
         } else {
             lson[nrt] = lson[rt];
             rson[nrt] = tot++;
             nrt = rson[nrt];
             rt = rson[rt];
             l = mid + ;
         }
         lc[nrt] = lc[rt] + lval;
         rc[nrt] = rc[rt] + rval;
     }

     return ret;
 }

 pii Query(int rt, int L, int R, int l, int r) {
     if (L==l && R==r)
         return mp(lc[rt], rc[rt]);

     int mid = (l + r) >> ;

     if (R <= mid) {
         return Query(lson[rt], L, R, l, mid);
     } else if (L > mid) {
         return Query(rson[rt], L, R, mid+, r);
     } else {
         pii ltmp = Query(lson[rt], L, mid, l, mid);
         pii rtmp = Query(rson[rt], mid+, R, mid+, r);
         return mp(ltmp.fir+rtmp.fir, ltmp.sec+rtmp.sec);
     }
 }

 void solve() {
     a[m++] = INF;
     a[m++] = ;
     sort(a, a+m);
     m = unique(a, a+m) - a;

     T[] = Build(, m-);
     queue<int> Q;
     int u, v;

     Q.push();
     while (!Q.empty()) {
         u = Q.front();
         Q.pop();
         if (son[u][]) {
             int wid = lower_bound(a, a+m, W[u]) - a;
             T[son[u][]] = Insert(T[u], wid, , );
             T[son[u][]] = Insert(T[u], wid, , );
             Q.push(son[u][]);
             Q.push(son[u][]);
         }
     }

     int q;
     int w;
     int n2, n7;

     scanf("%d", &q);
     while (q--) {
         scanf("%d %d", &v, &w);
         int wid = lower_bound(a, a+m, w) - a;
         if (a[wid] == w) {
             // check hit w
             pii eq = Query(T[v], wid, wid, , m-);
             if (eq.fir+eq.sec > ) {
                 puts("");
                 continue;
             }
         }

         pii lt = Query(T[v], , wid-, , m - );
         pii gt = Query(T[v], wid, m-, , m - );

         n2 = (gt.fir+gt.sec) + (lt.fir+lt.sec) * ;
         n7 = lt.sec;

         printf("%d %d\n", n7, n2);
     }
 }

 int main() {
     ios::sync_with_stdio(false);
     #ifndef ONLINE_JUDGE
         freopen("data.in", "r", stdin);
         freopen("data.out", "w", stdout);
     #endif

     int t;
     int u;

     scanf("%d", &t);
     rep(tt, , t+) {
         scanf("%d", &n);
         init();
         rep(i, , n+) {
             scanf("%d", &W[i]);
             a[m++] = W[i];
         }
         int k;
         scanf("%d", &k);
         rep(i, , k) {
             scanf("%d", &u);
             scanf("%d %d", &son[u][], &son[u][]);
         }
         solve();
     }

     #ifndef ONLINE_JUDGE
         printf("time = %d.\n", (int)clock());
     #endif

     return ;
 }

数据发生器。

 from copy import deepcopy
 from random import randint, shuffle
 import shutil
 import string

 def GenDataIn():
     with open("data.in", "w") as fout:
         t = 1
         bound = 10**5 / 2
         fout.write("%d\n" % (t))
         for tt in xrange(t):
             m = randint(100, 200)
             n = 2 * m + 1
             fout.write("%d\n" % (n))
             L = []
             for i in xrange(n):
                 w = randint(1, bound)
                 L.append(w)
             fout.write(" ".join(map(str, L)) + "\n")
             ust = [1]
             vst = range(2, n+1)
             fout.write("%d\n" % (m))
             for i in xrange(m):
                 idx = randint(0, len(ust)-1)
                 u = ust[idx]
                 ust.remove(u)
                 V = []
                 for j in xrange(2):
                     idx = randint(0, len(vst)-1)
                     v = vst[idx]
                     V.append(v)
                     ust.append(v)
                     vst.remove(v)
                 fout.write("%d %d %d\n" % (u, V[0], V[1]))
             q = randint(n/2, n)
             fout.write("%d\n" % (q))
             for i in xrange(q):
                 x = randint(1, n)
                 w = randint(1, bound)
                 fout.write("%d %d\n" % (x, w))

 def MovDataIn():
     desFileName = "F:\eclipse_prj\workspace\hdoj\data.in"
     shutil.copyfile("data.in", desFileName)

 if __name__ == "__main__":
     GenDataIn()
     MovDataIn()