HDOJ 题目2763 Housewife Wind(Link Cut Tree修改边权,查询两点间距离)
2015-08-25 22:11
405 查看
Housewife Wind
Description
After their royal wedding, Jiajia and Wind hid away in XX Village, to enjoy their ordinary happy life. People in XX Village lived in beautiful huts. There are some pairs of huts connected by bidirectional roads. We say that huts
in the same pair directly connected. XX Village is so special that we can reach any other huts starting from an arbitrary hut. If each road cannot be walked along twice, then the route between every pair is unique.
Since Jiajia earned enough money, Wind became a housewife. Their children loved to go to other kids, then make a simple call to Wind: 'Mummy, take me home!'
At different times, the time needed to walk along a road may be different. For example, Wind takes 5 minutes on a road normally, but may take 10 minutes if there is a lovely little dog to play with, or take 3 minutes if there is some unknown strange smell surrounding
the road.
Wind loves her children, so she would like to tell her children the exact time she will spend on the roads. Can you help her?
Input
The first line contains three integers n, q, s. There are n huts in XX Village, q messages to process, and Wind is currently in hut s. n < 100001 , q < 100001.
The following n-1 lines each contains three integers a, b and w. That means there is a road directly connecting hut a and b, time required is w. 1<=w<= 10000.
The following q lines each is one of the following two types:
Message A: 0 u
A kid in hut u calls Wind. She should go to hut u from her current position.
Message B: 1 i w
The time required for i-th road is changed to w. Note that the time change will not happen when Wind is on her way. The changed can only happen when Wind is staying somewhere, waiting to take the next kid.
Output
For each message A, print an integer X, the time required to take the next child.
Sample Input
Sample Output
Source
POJ Monthly--2006.02.26,zgl & twb
题目大意:操作 0 查询当前点到这个点的最短距离,操作1修改第k个边的权值
ac代码
Time Limit: 4000MS | Memory Limit: 65536K | |
Total Submissions: 7639 | Accepted: 1990 |
After their royal wedding, Jiajia and Wind hid away in XX Village, to enjoy their ordinary happy life. People in XX Village lived in beautiful huts. There are some pairs of huts connected by bidirectional roads. We say that huts
in the same pair directly connected. XX Village is so special that we can reach any other huts starting from an arbitrary hut. If each road cannot be walked along twice, then the route between every pair is unique.
Since Jiajia earned enough money, Wind became a housewife. Their children loved to go to other kids, then make a simple call to Wind: 'Mummy, take me home!'
At different times, the time needed to walk along a road may be different. For example, Wind takes 5 minutes on a road normally, but may take 10 minutes if there is a lovely little dog to play with, or take 3 minutes if there is some unknown strange smell surrounding
the road.
Wind loves her children, so she would like to tell her children the exact time she will spend on the roads. Can you help her?
Input
The first line contains three integers n, q, s. There are n huts in XX Village, q messages to process, and Wind is currently in hut s. n < 100001 , q < 100001.
The following n-1 lines each contains three integers a, b and w. That means there is a road directly connecting hut a and b, time required is w. 1<=w<= 10000.
The following q lines each is one of the following two types:
Message A: 0 u
A kid in hut u calls Wind. She should go to hut u from her current position.
Message B: 1 i w
The time required for i-th road is changed to w. Note that the time change will not happen when Wind is on her way. The changed can only happen when Wind is staying somewhere, waiting to take the next kid.
Output
For each message A, print an integer X, the time required to take the next child.
Sample Input
3 3 1 1 2 1 2 3 2 0 2 1 2 3 0 3
Sample Output
1 3
Source
POJ Monthly--2006.02.26,zgl & twb
题目大意:操作 0 查询当前点到这个点的最短距离,操作1修改第k个边的权值
Problem: 2763 User: kxh1995 Memory: 7636K Time: 1141MS Language: C++ Result: Accepted
ac代码
#include<stdio.h> #include<string.h> #include<stdlib.h> #include<queue> #include<iostream> using namespace std; int head[100010],cnt,vis[100050]; struct s { int u,v,w,next; }edge[150050<<1]; struct LCT { int bef[150050],pre[150050],next[150050][2],key[150050],sum[150050],belong[150050]; void init() { memset(pre,0,sizeof(pre)); memset(next,0,sizeof(next)); } void pushup(int x) { sum[x]=key[x]+sum[next[x][1]]+sum[next[x][0]]; } void rotate(int x,int kind) { int y,z; y=pre[x]; z=pre[y]; next[y][!kind]=next[x][kind]; pre[next[x][kind]]=y; next[z][next[z][1]==y]=x; pre[x]=z; next[x][kind]=y; pre[y]=x; pushup(y); } void splay(int x) { int rt; for(rt=x;pre[rt];rt=pre[rt]); if(x!=rt) { bef[x]=bef[rt]; bef[rt]=0; while(pre[x]) { if(next[pre[x]][0]==x) { rotate(x,1); } else rotate(x,0); } pushup(x); } } void access(int x) { int fa; for(fa=0;x;x=bef[x]) { splay(x); pre[next[x][1]]=0; bef[next[x][1]]=x; next[x][1]=fa; pre[fa]=x; bef[fa]=0; fa=x; pushup(x); } } void change(int x,int val) { int t; t=belong[x-1]; key[t]=val; splay(t); } int query(int x,int y) { access(y); for(y=0;x;x=bef[x]) { splay(x); if(!bef[x]) return sum[y]+sum[next[x][1]]; pre[next[x][1]]=0; bef[next[x][1]]=x; next[x][1]=y; pre[y]=x; bef[y]=0; y=x; pushup(x); } } }lct; void add(int u,int v,int w) { edge[cnt].u=u; edge[cnt].v=v; edge[cnt].w=w; edge[cnt].next=head[u]; head[u]=cnt++; } void bfs(int u) { int i,y; queue<int>q; memset(vis,0,sizeof(vis)); vis[u]=1; q.push(u); while(!q.empty()) { u=q.front(); q.pop(); for(int i=head[u];i!=-1;i=edge[i].next) { int v=edge[i].v; if(!vis[v]) { lct.bef[v]=u; lct.key[v]=lct.sum[v]=edge[i].w; lct.belong[i>>1]=v; vis[v]=1; q.push(v); } } } } int main() { int n,m,s; while(scanf("%d%d%d",&n,&m,&s)!=EOF) { int i; lct.init(); cnt=0; memset(head,-1,sizeof(head)); for(i=1;i<n;i++) { int u,v,w; scanf("%d%d%d",&u,&v,&w); add(u,v,w); add(v,u,w); } bfs(1); while(m--) { int op; scanf("%d",&op); if(!op) { int x; scanf("%d",&x); printf("%d\n",lct.query(s,x)); s=x; } else { int x,y; scanf("%d%d",&x,&y); lct.change(x,y); } } } }
相关文章推荐
- Jquery学习笔记---闭包
- Jquery 菜单插件之 Superfish jQuery菜单
- div css水平垂直居中
- jQuery学习笔记---兄弟元素、子元素和父元素的获取
- [leetcode] 116.Populating Next Right Pointers in Each Node
- js鼠标事件切换表格单元格背景色
- JavaScript prototype详解
- JavaScript prototype详解
- Slow Feature Analysis(SFA)模型
- PorterDuff及Xfermode详解
- JavaScript设计模式之----接口的实现
- node.js(五)字符串转换
- Javascript对象arguments和this
- html表单标记简单使用
- 移动前端不得不了解的html5 head 头标签
- css3颜色
- javascript Array总结
- node.js(四)path优化(路径优化)
- [leetcode-222]Count Complete Tree Nodes(c)
- Skype for Business Server 2015系列(三)部署前端服务器-3