Jzoj P5908 开荒___树链剖分+树状数组/线段树维护前缀和

最新推荐文章于 2021-10-20 19:27:46 发布

disPlayLzy_

最新推荐文章于 2021-10-20 19:27:46 发布

阅读量322

点赞数

分类专栏： C++ 树状数组线段树树链剖分前缀和

本文链接：https://blog.csdn.net/Gx_Man_VIP/article/details/83113184

版权

C++ 同时被 3 个专栏收录

368 篇文章 2 订阅

订阅专栏

线段树

35 篇文章 1 订阅

订阅专栏

前缀和

30 篇文章 0 订阅

订阅专栏

题目大意：

给出由 $n - 1$ 条无向边连成的 $n$ 个结点的一颗树，根结点为1，每个结点都有一个点权 $a_i$ ，有 $Q$ 次操作，
每次操作包括 $2$ 种：
① $C, x, y$ ，将结点 $x$ 的点权修改为 $y$
② $Q,k,c_1,c_2,...,c_k$ ，给出 $k$ 个结点，问这些结点间的路径构成的图包括的点的点权和。

$n, Q < = 100000$
$Σ k < = 1000000$

分析：

先对这棵树进行树链剖分：
用一遍 $d f s$ 求出树种结点的深度，子树大小，以及父亲与每个结点的重儿子
然后优先重儿子地去跑 $d f s$ ，求出 $d f s$ 序，记录每条轻重链的起点

然后我们对于每次询问就先将 $k$ 个点按深度升序排列，
那么我们可以发现任意两个结点 $x, y$ 间能产生点权和，就是它们分别到 $lca_{x,y}$ 的路径的点权和+ $lca_{x,y}$ 的点权
然后相邻两点间这样路径我们全部在树上表示，可以发现对于它们能构成的图中的边，都被覆盖了两边，即这些产生的贡献恰好是点权和的2倍，那么我们就可以维护一下相邻两点的贡献了：
我们可以发现任意一条轻(重)链它们被dfs到的顺序是连续，即dfs序是连续的，那么就可以愉悦以 $d f s$ 序为基础快乐前缀和。
~~前缀和维护，线段树500ms，树状200ms，有点毒瘤~~

代码：

①线段树维护前缀和：

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <queue>
#define N 100005

using namespace std;

typedef long long ll;

struct Node { int To, nxt; }e[N*2];
struct Code { int l, r; ll sum; }t[N*5];
int begind[N], Size[N], hson[N], deep[N], dfn[N], orz[N], fa[N], ls[N], a[N], C[N*10];
int n, m, tot, num, cnt;

int read(int &x)
{
    int f = 1; x = 0; char s = getchar();
	while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
	while (s >= '0' && s <= '9') { x = x * 10 + (s - '0'); s = getchar(); }
	x = x * f;	
}

bool cmp(int aa, int bb)
{	
	return dfn[aa] < dfn[bb];
}

void Addedge(int u, int v)
{
	e[++cnt].To = v, e[cnt].nxt = ls[u], ls[u] = cnt;
	e[++cnt].To = u, e[cnt].nxt = ls[v], ls[v] = cnt;
}

void dfs1(int x, int father)
{
	Size[x] = 1; fa[x] = father; 
	for (int i = ls[x]; i; i = e[i].nxt)
	{
		if (e[i].To == father) continue;
		int y = e[i].To; deep[y] = deep[x] + 1;
		dfs1(y, x); Size[x] += Size[y]; 
		if(Size[y] > Size[hson[x]]) hson[x] = y;
	}
}

void dfs2(int x, int firstd)
{
	begind[x] = firstd; dfn[x] = ++num; orz[num] = x;
	if (hson[x]) dfs2(hson[x], firstd);
	for (int i = ls[x]; i; i = e[i].nxt)
         if (!dfn[e[i].To]) dfs2(e[i].To, e[i].To);
}

int Get_lca(int x, int y)
{
	while (begind[x] != begind[y])
	{
	   if(deep[begind[x]] < deep[begind[y]]) swap(x, y);
	   x = fa[begind[x]];
	}
    return ((deep[x] > deep[y]) ? y : x);
}

void Update(int G)
{
	t[G].sum = t[G * 2].sum + t[G * 2 + 1].sum;
}

void Build(int G, int l, int r)
{
	t[G].l = l, t[G].r = r;
	if (l == r) { t[G].sum = a[orz[l]]; return; }
	int mid = (l + r) >> 1;
	Build(G * 2, l, mid); 
	Build(G * 2 + 1, mid + 1, r);
	Update(G);
}

void Change(int G, int id, ll w)
{
	if(t[G].l == t[G].r) { t[G].sum = w; return; }
	int mid = (t[G].l + t[G].r) >> 1;
	if (mid >= id) Change(G * 2, id, w);
	          else Change(G * 2 + 1, id, w);
	Update(G);
}

ll Get_sum(int G, int l, int r)
{
	if  (l <= t[G].l && t[G].r <= r) return t[G].sum;
	if (t[G].l > r || t[G].r < l) return (ll)0;
	return Get_sum(G * 2, l, r) + Get_sum(G * 2 + 1, l, r);
}

ll Q(int x, int y)
{
	ll sum = 0;
	while (begind[x] != begind[y])
	{
		if (deep[begind[x]] < deep[begind[y]]) swap(x, y);
		sum += Get_sum(1, dfn[begind[x]], dfn[x]);
		x = fa[begind[x]];
	}
	if(deep[x] < deep[y]) swap(x, y);
	sum = sum + Get_sum(1, dfn[y], dfn[x]) - a[y];
	return sum;
}

int main()
{
	freopen("kaihuang.in","r",stdin);
	freopen("kaihuang.out","w",stdout);
	read(n); read(m); 
	for (int i = 1; i <= n; i++) read(a[i]);
	for (int i = 1; i < n; i++)
	{
		int u, v; read(u); read(v); Addedge(u, v);
	}
	deep[1] = 1, dfs1(1, -1), dfs2(1, 1), Build(1, 1, n);
	for (int i = 1; i <= m; i++)
	{
		char s[10]; scanf("%s", s); int x; ll y;
		if (s[0] == 'C') read(x), scanf("%lld", &y), a[x] = y, Change(1, dfn[x], y);
	  	else 
	    { 
			tot = 0; ll ans = 0; int x;
			read(x); while (x) { C[++tot] = x, read(x); } 
			sort(C + 1, C + tot + 1, cmp);
			int LCA = C[1]; for (int i = 2; i <= tot; i++) LCA = Get_lca(LCA, C[i]);
			for (int i = 1; i < tot; i++) ans += Q(C[i], C[i + 1]); ans += Q(C[1], C[tot]);
			printf("%lld\n", ans / 2 + a[LCA]);
		}
	}
	return 0;
}

②树状数组维护前缀和：

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <queue>
#define N 100005

using namespace std;

typedef long long ll;

struct Node { int To, nxt; }e[N*2];
int begind[N], Size[N], hson[N], deep[N], dfn[N], fa[N], ls[N], a[N], C[N*10];
int n, m, tot, num, cnt;
ll sum[N];

int read(int &x)
{
    int f = 1; x = 0; char s = getchar();
	while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
	while (s >= '0' && s <= '9') { x = x * 10 + (s - '0'); s = getchar(); }
	x = x * f;	
}

bool cmp(int aa, int bb)
{	
	return dfn[aa] < dfn[bb];
}

void Addedge(int u, int v)
{
	e[++cnt].To = v, e[cnt].nxt = ls[u], ls[u] = cnt;
	e[++cnt].To = u, e[cnt].nxt = ls[v], ls[v] = cnt;
}

void dfs1(int x, int father)
{
	Size[x] = 1; fa[x] = father; 
	for (int i = ls[x]; i; i = e[i].nxt)
	{
		if (e[i].To == father) continue;
		int y = e[i].To; deep[y] = deep[x] + 1;
		dfs1(y, x); Size[x] += Size[y]; 
		if(Size[y] > Size[hson[x]]) hson[x] = y;
	}
}

void dfs2(int x, int firstd)
{
	begind[x] = firstd; dfn[x] = ++num; 
	if (hson[x]) dfs2(hson[x], firstd);
	for (int i = ls[x]; i; i = e[i].nxt)
         if (!dfn[e[i].To]) dfs2(e[i].To, e[i].To);
}

int Get_lca(int x, int y)
{
	while (begind[x] != begind[y])
	{
	   if(deep[begind[x]] < deep[begind[y]]) swap(x, y);
	   x = fa[begind[x]];
	}
    return ((deep[x] > deep[y]) ? y : x);
}

void Insert(int x, ll cc)
{
   for (; x <= n; x += (x & (-x))) sum[x] += cc;
}

ll Get_sum(int l, int r)
{
   ll rp = 0; l--;
   for (; r; r -= (r & (-r))) rp += sum[r]; 
   for (; l; l -= (l & (-l))) rp -= sum[l];
   return rp;
}

ll Work(int x, int y)
{
	ll sum = 0;
	while (begind[x] != begind[y])
	{
		if (deep[begind[x]] < deep[begind[y]]) swap(x, y);
		sum += Get_sum(dfn[begind[x]], dfn[x]);
		x = fa[begind[x]];
	}
	if(deep[x] < deep[y]) swap(x, y);
	sum = sum + Get_sum(dfn[y], dfn[x]) - a[y];
	return sum;
}

int main()
{
	freopen("kaihuang.in","r",stdin);
	freopen("kaihuang.out","w",stdout);
	read(n); read(m); 
	for (int i = 1; i <= n; i++) read(a[i]);
	for (int i = 1; i < n; i++)
	{
		int u, v; read(u); read(v); Addedge(u, v);
	}
	deep[1] = 1, dfs1(1, -1), dfs2(1, 1);
	for (int i = 1; i <= n; i++) Insert(dfn[i], a[i]); 
	for (int i = 1; i <= m; i++)
	{
		char s[10]; scanf("%s", s); int x; ll y;
		if (s[0] == 'C') read(x), scanf("%lld", &y), Insert(dfn[x], y - a[x]), a[x] = y;
	  	else 
	    { 
			tot = 0; ll ans = 0; int x;
			read(x); while (x) { C[++tot] = x, read(x); } 
			sort(C + 1, C + tot + 1, cmp);
			int LCA = C[1]; for (int i = 2; i <= tot; i++) LCA = Get_lca(LCA, C[i]);
			for (int i = 1; i < tot; i++) ans += Work(C[i], C[i + 1]); ans += Work(C[1], C[tot]);
			printf("%lld\n", ans / 2 + a[LCA]);
		}
	}
	return 0;
}

disPlayLzy_

关注

0
点赞
踩
1

收藏

觉得还不错? 一键收藏
0
评论
Jzoj P5908 开荒___树链剖分+树状数组/线段树维护前缀和

题目大意：给出由n−1n-1n−1条无向边连成的nnn个结点的一颗树，根结点为1，每个结点都有一个点权aia_iai，有QQQ次操作，每次操作包括222种：①C,x,yC,x,yC,x,y，将结点xxx的点权修改为yyy②Q,k,c1,c2,...,ckQ,k,c_1,c_2,...,c_kQ,k,c1,c2,...,ck，给出kkk个结点，问这些结点间的路径构成的图包括的点的点权...
复制链接

扫一扫