BZOJ 1036

1036: [ZJOI2008]树的统计Count

此题卡cin，用cin读入字符串，一直TLE
把cin换成scanf 就AC了

BZOJ 1036

/**************************************************************
    Problem: 1036
    User: Dream_Tonight
    Language: C++
    Result: Accepted
    Time:2712 ms
    Memory:5548 kb
****************************************************************/
 
#include <algorithm>
#include <iostream>
#include <cstring>
#include <vector>
#include <string>
#include <cstdio>
#include <cmath>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <set>
 
using namespace std;
#define ls rt << 1
#define rs rt << 1 | 1
#define lson l , mid , ls
#define rson mid + 1 , r , rs
typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 30000 + 7;
const int inf = 2139062143;
const int mod = 10007;
 
int fa[maxn], son[maxn], sz[maxn], rk[maxn];
int top[maxn], head[maxn], deep[maxn], id[maxn];
int color[maxn], sum[maxn << 2], mx[maxn << 2];
int cnt = 0, ret = 0;
int a, b;
 
struct node {
    int to, next;
} edge[maxn << 1];
 
void add(int u, int v) {
    edge[++ret] = (node) {v, head[u]}, head[u] = ret;
    edge[++ret] = (node) {u, head[v]}, head[v] = ret;
}
 
void dfs1(int x, int f) {
    sz[x] = 1, fa[x] = f, deep[x] = deep[f] + 1, son[x] = 0;
    for (int i = head[x]; i; i = edge[i].next) {
        int v = edge[i].to;
        if (v == f) continue;
        dfs1(v, x);
        if (sz[son[x]] < sz[v]) son[x] = v;
        sz[x] += sz[v];
    }
}
 
void dfs2(int x, int tp) {
    top[x] = tp, id[x] = ++cnt, rk[cnt] = color[x];
    if (son[x]) dfs2(son[x], tp);
    for (int i = head[x]; i; i = edge[i].next) {
        int v = edge[i].to;
        if (v == son[x] || v == fa[x]) continue;
        dfs2(v, v);
    }
}
 
void push_up(int rt) {
    sum[rt] = sum[ls] + sum[rs];
    mx[rt] = max(mx[ls], mx[rs]);
}
 
void build(int l, int r, int rt) {
    if (l == r) {
        mx[rt] = sum[rt] = rk[l];
        return;
    }
    int mid = (l + r) / 2;
    build(lson);
    build(rson);
    push_up(rt);
}
 
void update(int l, int r, int rt, int L, int V) {
    if (l == r) {
        mx[rt] = sum[rt] = V;
        return;
    }
    int mid = (l + r) / 2;
    if (mid >= L) update(lson, L, V);
    else update(rson, L, V);
    push_up(rt);
}
 
int query_sum(int l, int r, int rt, int L, int R) {
    if (L <= l && r <= R) {
        return sum[rt];
    }
    int mid = (l + r) / 2, res = 0;
    if (mid >= L) res += query_sum(lson, L, R);
    if (mid < R) res += query_sum(rson, L, R);
    return res;
}
 
int query_max(int l, int r, int rt, int L, int R) {
    if (L <= l && r <= R) {
        return mx[rt];
    }
    int mid = (l + r) / 2, res = -inf;
    if (mid >= L) res = max(res, query_max(lson, L, R));
    if (mid < R) res = max(res, query_max(rson, L, R));
    return res;
}
 
int main() {
#ifndef ONLINE_JUDGE
    freopen("weather.in", "r", stdin);
#endif
    int x, y, n, m;
    scanf("%d", &n);
    for (int i = 1; i < n; i++) {
        scanf("%d%d", &x, &y);
        add(x, y);
    }
    memset(mx, -127, sizeof(mx));
    for (int i = 1; i <= n; i++)scanf("%d", &color[i]);
    dfs1(1, 0), dfs2(1, 0);
    build(1, n, 1);
    scanf("%d", &m);
    for (int i = 1; i <= m; i++) {
        char ch[14];
        scanf("%s", ch);
        scanf("%d%d", &a, &b);
        if (ch[1] == 'M') {
            int res = -inf;
            while (top[a] != top[b]) {
                if (deep[top[a]] < deep[top[b]]) swap(a, b);
                res = max(res, query_max(1, n, 1, id[top[a]], id[a]));
                a = fa[top[a]];
            }
            if (deep[a] > deep[b]) swap(a, b);
            res = max(res, query_max(1, n, 1, id[a], id[b]));
            printf("%d\n", res);
        } else if (ch[1] == 'S') {
            int res = 0;
            while (top[a] != top[b]) {
                if (deep[top[a]] < deep[top[b]]) swap(a, b);
                res += query_sum(1, n, 1, id[top[a]], id[a]);
                a = fa[top[a]];
            }
            if (deep[a] > deep[b]) swap(a, b);
            res += query_sum(1, n, 1, id[a], id[b]);
            printf("%d\n", res);
        } else {
            update(1, n, 1, id[a], b);
        }
    }
    return 0;
}