Aragorn's Story

Time Limit: 10000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

【Problem Description】
Our protagonist is the handsome human prince Aragorn comes from The Lord of the Rings. One day Aragorn finds a lot of enemies who want to invade his kingdom. As Aragorn knows, the enemy has N camps out of his kingdom and M edges connect them. It is guaranteed that for any two camps, there is one and only one path connect them. At first Aragorn know the number of enemies in every camp. But the enemy is cunning , they will increase or decrease the number of soldiers in camps. Every time the enemy change the number of soldiers, they will set two camps C1 and C2. Then, for C1, C2 and all camps on the path from C1 to C2, they will increase or decrease K soldiers to these camps. Now Aragorn wants to know the number of soldiers in some particular camps real-time.
 
【Input】
Multiple test cases, process to the end of input.
For each case, The first line contains three integers N, M, P which means there will be N(1 ≤ N ≤ 50000) camps, M(M = N-1) edges and P(1 ≤ P ≤ 100000) operations. The number of camps starts from 1.
The next line contains N integers A1, A2, ...AN(0 ≤ Ai ≤ 1000), means at first in camp-i has Ai enemies.
The next M lines contains two integers u and v for each, denotes that there is an edge connects camp-u and camp-v.
The next P lines will start with a capital letter 'I', 'D' or 'Q' for each line.
'I', followed by three integers C1, C2 and K( 0≤K≤1000), which means for camp C1, C2 and all camps on the path from C1 to C2, increase K soldiers to these camps.
'D', followed by three integers C1, C2 and K( 0≤K≤1000), which means for camp C1, C2 and all camps on the path from C1 to C2, decrease K soldiers to these camps.
'Q', followed by one integer C, which is a query and means Aragorn wants to know the number of enemies in camp C at that time.
 
【Output】
For each query, you need to output the actually number of enemies in the specified camp.
 
【Sample Input】

I
Q
D
Q
Q
【Sample Output】

【Hint】

1.The number of enemies may be negative.

2.Huge input, be careful.

 
 
【分析】
解1:
动态维护树中路径上点的边权值。
 
两个点之间的路径只要找到最近公共祖先即可
主要还是找LCA这块,动态树中的这个操作是改造一下access,然后注意各标志的下放。
 
【教训】
跟上一次一样,也是TLE了很久,关键在于上组数据的状态量没有清理干净,重点是father和sons没有清空,结果就被坑了很久。
下次尤其注意!!
 
 /* ***********************************************
MYID : Chen Fan
LANG : G++
PROG : HDU 3966
************************************************ */ #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue> using namespace std; #define MAXN (int)5E4+10
#define MAXM (int)1E5+10 typedef struct nod
{
int a,b;
} node;
node edge[MAXM]; bool op(node a,node b)
{
if (a.a==b.a) return a.b<b.b;
else return a.a<b.a;
} int sons[MAXN][];
int father[MAXN],size[MAXN],data[MAXN],change[MAXN];
int start[MAXN],num[MAXN];
bool root[MAXN]; void bfs(int s)
{
queue<int>q;
q.push(s);
root[s]=true;
change[s]=;
while(!q.empty())
{
int now=q.front();
for (int i=;i<num[now];i++)
if (!root[edge[start[now]+i].b])
{
father[edge[start[now]+i].b]=now;
root[edge[start[now]+i].b]=true;
change[edge[start[now]+i].b]=;
q.push(edge[start[now]+i].b);
}
q.pop();
}
} void down(int x)
{
if (change[x])
{
data[x]+=change[x];
change[sons[x][]]+=change[x];
change[sons[x][]]+=change[x];
change[x]=;
}
} void rotate(int x,int w) //rotate(node,0/1)
{
int y=father[x]; down(y);
down(x); sons[y][!w]=sons[x][w];
if (sons[x][w]) father[sons[x][w]]=y;
father[x]=father[y];
if (father[y]&&(!root[y])) sons[father[y]][y==sons[father[y]][]]=x;
sons[x][w]=y;
father[y]=x; if (root[y])
{
root[x]=true;
root[y]=false;
}
} void splay__(int x) //splay(node)
{
down(x);
while(!root[x])
{
if (root[father[x]]) rotate(x,x==sons[father[x]][]);
else
{
int t=father[x];
int w=(sons[father[t]][]==t);
if (sons[t][w]==x)
{
rotate(x,!w);
rotate(x,w);
} else
{
rotate(t,w);
rotate(x,w);
}
}
}
} void splay(int x) //splay(node)
{
down(x);
while(!root[x])
{
if (sons[father[x]][]==x) rotate(x,);
else rotate(x,);
}
} void access(int v)
{
int u=v;
v=;
while(u)
{
splay(u);
down(u);
root[sons[u][]]=true;
sons[u][]=v;
root[v]=false;
v=u;
u=father[u];
}
} void update(int v,int u,int k)
{
access(v);
v=;
while(u)
{
splay(u);
if (!father[u])
{
data[u]+=k;
change[v]+=k;
change[sons[u][]]+=k;
return;
}
down(u);
root[sons[u][]]=true;
sons[u][]=v;
root[v]=false;
v=u;
u=father[u];
}
} int INT() {
char ch;
int res;
bool neg;
while (ch = getchar(), !isdigit(ch) && ch != '-')
;
if (ch == '-') {
neg = true;
res = ;
} else {
neg = false;
res = ch - '';
}
while (ch = getchar(), isdigit(ch))
res = res * + ch - '';
return neg ? -res : res;
} char CHAR() {
char res;
while (res = getchar(), !isalpha(res))
;
return res;
} int main()
{
freopen("3966.txt","r",stdin); int n,m,p;
while(scanf("%d%d%d",&n,&m,&p)!=EOF)
{
memset(father,,sizeof(father));
memset(sons,,sizeof(sons)); for (int i=;i<=n;i++) data[i]=INT(); for (int i=;i<=m;i++)
{
int a,b;
a=INT();
b=INT();
edge[i*].a=a;
edge[i*].b=b;
edge[i*-].a=b;
edge[i*-].b=a;
}
m*=;
sort(&edge[],&edge[m+],op);
memset(num,,sizeof(num));
int o=-;
for (int i=;i<=m;i++)
{
if (o!=edge[i].a)
{
o=edge[i].a;
start[o]=i;
}
num[o]++;
}
memset(root,,sizeof(root));
bfs(); for (int i=;i<=p;i++)
{
char s;
s=CHAR();
switch(s)
{
case 'I':
int c1,c2,k;
c1=INT();c2=INT();k=INT();
update(c1,c2,k);
break;
case 'D':
c1=INT();c2=INT();k=INT();
update(c1,c2,-k);
break;
case 'Q':
int c;
c=INT();
splay(c);
printf("%d\n",data[c]);
}
}
} return ;
}
 
解2:
由于这里的树结构是固定不变的,因此也可以使用树链剖分来做。
 
【教训】
......DFS剖分爆栈的问题还是比较严重啊......T_T......也是第一次写,没经验,差错查了好久,用BFS代替之
 /* ***********************************************
MYID : Chen Fan
LANG : G++
PROG : HDU 3966_TreeCut
************************************************ */ #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm> using namespace std; #define MAXN (int)5E4+10
#define MAXM (int)1E5+10 int n; int son[MAXN];
int father[MAXN],size[MAXN],level[MAXN],data[MAXN],top[MAXN];
int start[MAXN],num[MAXN]; typedef struct nod
{
int a,b;
} node;
node edge[MAXM]; bool op(node a,node b)
{
if (a.a==b.a) return a.b<b.b;
else return a.a<b.a;
} int lowbit(int s)
{
return s&(-s);
}
int c[MAXN],pos[MAXN];
int tot; void update(int x,int s)
{
while (x<=n)
{
c[x]+=s;
x+=lowbit(x);
}
} int sum(int x)
{
int t=;
while (x>)
{
t+=c[x];
x-=lowbit(x);
}
return t;
} void dfs(int now,int front,int d)
{
level[now]=d;
father[now]=front;
size[now]=;
for (int i=;i<num[now];i++)
{
int temp=edge[start[now]+i].b;
if (temp!=front)
{
dfs(temp,now,d+);
size[now]+=size[temp];
if (son[now]==||size[temp]>size[son[now]]) son[now]=temp;
}
}
} int q[MAXN];
void bfs()
{
int head=,tail=;
q[]=;
level[]=;
father[]=;
while(head<=tail)
{
int now=q[head];
size[now]=;
for (int i=;i<num[now];i++)
{
int temp=edge[start[now]+i].b;
if (temp!=father[now])
{
father[temp]=now;
level[temp]=level[now]+;
tail++;
q[tail]=temp;
}
}
head++;
}
for (int i=n;i>=;i--)
{
int now=q[i];
if (father[now])
{
size[father[now]]+=size[now];
if (son[father[now]]==||size[now]>size[son[father[now]]])
son[father[now]]=now;
}
} for (int i=;i<=n;i++)
{
int now=q[i];
if (son[father[now]]==now) top[now]=top[father[now]];
else
{
top[now]=now;
while(now)
{
tot++;
pos[now]=tot;
now=son[now];
}
}
}
} void treecut(int now,int root)
{
top[now]=root;
tot++;
pos[now]=tot; if (!son[now]) return ;
treecut(son[now],root); for (int i=;i<num[now];i++)
{
int temp=edge[start[now]+i].b;
if (temp!=father[now]&&temp!=son[now]) treecut(temp,temp);
}
} void change(int x,int y,int value)
{
while(top[x]!=top[y])
{
if (level[top[x]]<level[top[y]]) swap(x,y);
update(pos[top[x]],value);
update(pos[x]+,-value);
x=father[top[x]];
}
if (level[x]>level[y]) swap(x,y); update(pos[x],value);
update(pos[y]+,-value);
} int main()
{
freopen("3966.txt","r",stdin); int m,p;
while(scanf("%d%d%d",&n,&m,&p)!=EOF)
{
for (int i=;i<=n;i++) scanf("%d",&data[i]); for (int i=;i<=m;i++)
{
int a,b;
scanf("%d%d",&a,&b);
edge[i*].a=a;
edge[i*].b=b;
edge[i*-].a=b;
edge[i*-].b=a;
}
m*=;
sort(&edge[],&edge[m+],op);
memset(num,,sizeof(num));
int o=-;
for (int i=;i<=m;i++)
{
if (o!=edge[i].a)
{
o=edge[i].a;
start[o]=i;
}
num[o]++;
} memset(son,,sizeof(son));
tot=;
//dfs(1,0,0);
//treecut(1,1);
bfs(); memset(c,,sizeof(c));
for (int i=;i<=n;i++)
{
update(pos[i],data[i]);
update(pos[i]+,-data[i]);
} for (int i=;i<=p;i++)
{
char s;
s=getchar();
while (s!='Q'&&s!='I'&&s!='D') s=getchar();
if (s=='Q')
{
int cc;
scanf("%d",&cc);
printf("%d\n",sum(pos[cc]));
} else
{
int c1,c2,k;
scanf("%d%d%d",&c1,&c2,&k);
if (s=='D') k=-k;
change(c1,c2,k);
}
}
} return ;
}
 

HDU 3966 Aragorn's Story 动态树 树链剖分的更多相关文章

  1. HDU 3966 Aragorn&#39;s Story(树链剖分)

    HDU Aragorn's Story 题目链接 树抛入门裸题,这题是区间改动单点查询,于是套树状数组就OK了 代码: #include <cstdio> #include <cst ...

  2. HDU 3966 Aragorn's Story 树链剖分+树状数组 或 树链剖分+线段树

    HDU 3966 Aragorn's Story 先把树剖成链,然后用树状数组维护: 讲真,研究了好久,还是没明白 树状数组这样实现"区间更新+单点查询"的原理... 神奇... ...

  3. hdu 3966 Aragorn&#39;s Story(树链剖分+树状数组)

    pid=3966" target="_blank" style="">题目链接:hdu 3966 Aragorn's Story 题目大意:给定 ...

  4. HDU - 3966 Aragorn's Story(树链剖分入门+线段树)

    HDU - 3966 Aragorn's Story Time Limit: 3000MS   Memory Limit: 32768KB   64bit IO Format: %I64d & ...

  5. Hdu 3966 Aragorn's Story (树链剖分 + 线段树区间更新)

    题目链接: Hdu 3966 Aragorn's Story 题目描述: 给出一个树,每个节点都有一个权值,有三种操作: 1:( I, i, j, x ) 从i到j的路径上经过的节点全部都加上x: 2 ...

  6. HDU 3966 Aragorn's Story (树链点权剖分,成段修改单点查询)

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3966 树链剖分的模版,成段更新单点查询.熟悉线段树的成段更新的话就小case啦. //树链剖分 边权修 ...

  7. hdu 3966 Aragorn's Story(树链剖分+树状数组/线段树)

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3966 题意: 给出一棵树,并给定各个点权的值,然后有3种操作: I C1 C2 K: 把C1与C2的路 ...

  8. hdu 3966 Aragorn's Story(树链剖分+区间修改+单点查询)

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3966 题意:给一棵树,并给定各个点权的值,然后有3种操作: I C1 C2 K: 把C1与C2的路径上 ...

  9. HDU 3966 Aragorn's Story (树链剖分+树状数组)

    Aragorn's Story Time Limit: 10000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...

随机推荐

  1. 使用gulp构建nodejs,你只需要记住5个函数

    gulp gulp是一个nodejs的streaming构建工具,所谓的streaming大致意思就是把构建流程想成一个个链接的管道(pipe). 为什么要这样做呢? 要解释原因,就不得不提到unix ...

  2. html5实现滚动文字

    <div class="custom-notice"> <i class="icon-notice"></i> <ma ...

  3. JavaScript 操作符 变量

    一.操作符: 一元操作符 递增操作符 递减操作符 分为 前置型(--a    ++a) 和 后置型 (a--    a++) 区别如下: var a = 3,b=6; c = --a +b; //c= ...

  4. [转]深入浅出JSONP--解决ajax跨域问题

    取不到数据! 上周客户新买了服务器,原本在旧的服务器上放着客户的Web主页信息和一个后台程序(asp.net),在客户的主页中有一个动态显示最新消息的处理,这个处理就是通过ajax异步从那个后台程序中 ...

  5. 眼睛跟踪 java

    https://github.com/hosek/eyeTrackSample Simple sample, for eye tracking with OpenCV

  6. LeetCode OJ 118. Pascal's Triangle

    Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5,Retur ...

  7. 解决“Xlib.h not found when building graphviz on Mac OS X 10.8”错误

    After installing XQuartz you may add a symlink to your X11 installation folder by just entering (安装X ...

  8. Head First - 01.策略模式(Strategy Pattern)

    策略模式定义了算法族,分别封装起来,让它们之间可以互相替换,此模式让算法的变化独立于使用算法的客户. 当你需要给朋友留下深刻印象,或是影响关键主管的决策时,请使用“这个”定义!  设计原则: 1.找出 ...

  9. 硬盘安装win8系统方法汇总

    从硬盘安装 (推荐)硬盘安装方法一 使用Nt6 hdd installer进行安装,此方法适合XP,vista, Windows 7等系统. 下载Nt6 hdd installer(Win8硬盘安装工 ...

  10. Eclipse下配置和使用Hibernate Tools

    本文转自:http://radiumwong.iteye.com/blog/358585 Hibernate Tools可以通过访问已经建立好的数据库以反向工程方式生成POJO文件. 今天就来说一下如 ...