ACM-ICPC 2018 沈阳赛区网络预赛 A1998 Ka Chang

公开20190725博客，汗

题目链接：https://nanti.jisuanke.com/t/A1998

A：分块二分，dfs序，线段树单点更新区间求和

AC代码：

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 1e5 + 5;
vector<int>son[maxn],did[maxn],tmp;
ll head[maxn],tail[maxn],dep[maxn],sid[maxn],tot;
ll laz[maxn];
struct Tree
{
    ll sum;
    Tree(){sum = 0;}
}tree[maxn<<2];

void update(ll rt,ll id,ll L,ll R,ll x)
{
    if(L == R && L == id)
    {
        tree[rt].sum += x;
        return ;
    }
    ll mid = (L + R)>>1;
    if(id <= mid) update(rt<<1,id,L,mid,x);
    else update(rt<<1|1,id,mid + 1,R,x);
    tree[rt].sum = tree[rt<<1].sum + tree[rt<<1|1].sum;
}

ll query(ll rt,ll l,ll r,ll L,ll R)
{
    if(l <= L && R <= r) return tree[rt].sum;
    ll mid = (L + R)>>1,ans = 0;
    if(l <= mid) ans += query(rt<<1,l,r,L,mid);
    if(r > mid)  ans += query(rt<<1|1,l,r,mid + 1,R);
    return ans;
}

void dfs(ll x,ll depp)
{
    head[x] = ++tot,sid[tot] = x,dep[depp] ++;
    did[depp].push_back(tot);///!x->tot
    ll len = son[x].size();
    for(ll i = 0;i<len;i++) dfs(son[x][i],depp+1);
    tail[x] = tot;
}

void init(ll n)
{
    for(ll i = 0;i<=n;i++)
    {
        son[i].clear(),did[i].clear();
        laz[i] = dep[i] = 0;
    }
    tmp.clear();
    tot = 0;
}

int main()
{
    ll n,q;
    scanf("%lld%lld",&n,&q);
    init(n);
    for(ll i = 1;i<n;i++)
    {
        ll x,y;
        scanf("%lld%lld",&x,&y);
        son[x].push_back(y);
    }
    dfs(1,0);
    while(q--)
    {
        ll op,l,x;
        scanf("%lld",&op);
        if(op == 1)
        {
            scanf("%lld%lld",&l,&x);
            if(1ll*dep[l]*dep[l] <= n)
            {
                ll len = did[l].size();
                for(ll i = 0;i<len;i++) update(1,did[l][i],1,n,x);
            }
            else
            {
                if(!laz[l]) tmp.push_back(l);
                laz[l] += x;
            }
        }
        else
        {
            scanf("%lld",&x);
            ll ans = query(1,head[x],tail[x],1,n);
            ll len = tmp.size();
            for(ll i = 0;i<len;i++) ans += 1ll * (upper_bound(did[tmp[i]].begin(),did[tmp[i]].end(),tail[x]) - lower_bound(did[tmp[i]].begin(),did[tmp[i]].end(),head[x])) * laz[tmp[i]];
            printf("%lld\n",ans);
        }
    }
}

时间复杂度算错了：分块分的不好

上到下的分块条件依次是：

1.  

2.  

3.  0，即：不分块

4.  

B：kd-tree