hdu6393Traffic Network in Numazu【树状数组】【LCA】
Traffic Network in Numazu
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 677 Accepted Submission(s): 269
Problem Description
Chika is elected mayor of Numazu. She needs to manage the traffic in this city. To manage the traffic is too hard for her. So she needs your help.
You are given the map of the city —— an undirected connected weighted graph with N nodes and N edges, and you have to finish Q missions. Each mission consists of 3 integers OP, X and Y.
When OP=0, you need to modify the weight of the Xth edge to Y.
When OP=1, you need to calculate the length of the shortest path from node X to node Y.
Input
The first line contains a single integer T, the number of test cases.
Each test case starts with a line containing two integers N and Q, the number of nodes (and edges) and the number of queries. (3≤N≤105)(1≤Q≤105)
Each of the following N lines contain the description of the edges. The ith line represents the ith edge, which contains 3 space-separated integers ui, vi, and wi. This means that there is an undirected edge between nodes ui and vi, with a weight of wi. (1≤ui,vi≤N)(1≤wi≤105)
Then Q lines follow, the ith line contains 3 integers OP, X and Y. The meaning has been described above.(0≤OP≤1)(1≤X≤105)(1≤Y≤105)
It is guaranteed that the graph contains no self loops or multiple edges.
Output
For each test case, and for each mission whose OP=1, print one line containing one integer, the length of the shortest path between X and Y.
Sample Input
2 5 5 1 2 3 2 3 5 2 4 5 2 5 1 4 3 3 0 1 5 1 3 2 1 5 4 0 5 4 1 5 1 5 3 1 2 3 1 3 2 3 4 4 4 5 5 2 5 5 0 1 3 0 4 1 1 1 4
Sample Output
5 6 6 6
Source
2018 Multi-University Training Contest 7
Recommend
chendu | We have carefully selected several similar problems for you: 6408 6407 6406 6405 6404
看题目就觉得是会是一道线段树单点修改区间查询
但是题目是一个图 n个点n条边
于是czc提出去掉一条边 看了题解果然是这样子
- 先把环中的任意一条边去除,边连接的两点记为r1,r2
- 每次查询的时候,x与y之间的距离有三个:(1)去除边后树上的最短距离;(2)x->r1->r2->y;(3) x->r2->r1->y。取三个值中的最小值即可
树状数组和线段树是非常相近的 今天去查了一下区别
树状数组可以解决的题目线段树都一定能解决,但是反之不一定
也就是说线段树的功能更强大一点
但是树状数组写起来比较方便,而且常数比线段树好,速度快
这道题因为是问区间和 所以树状数组够用了
这道题还有一个知识点是LCA
树上的最短路可以用LCA来求 Tarjan算法 = dfs序+并查集的find
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<stack>
#define inf 1e18
using namespace std;
int t, n, q;
const int maxn = 100050;
struct edge{
int v, nxt, val;
}e[maxn * 2];
int head[maxn], tot;
void addedge(int x, int y, int d)
{
e[++tot] = (edge){y, head[x], d};
head[x] = tot;
}
long long sum[maxn];
void add(int x, int val)
{
while(x <= n){
sum[x] += val;
x += (x & -x);
}
}
long long query(int x)
{
long long ans = 0;
while(x){
ans += sum[x];
x -= (x & -x);
}
return ans;
}
int fa[maxn];
int find(int x)
{
if(x == fa[x]){
return x;
}
else
return fa[x] = find(fa[x]);
}
int idx[maxn], cnt;//dfs序
int dep[maxn], f[maxn][20], r[maxn];
void dfs(int x, int par, int val)
{
fa[x] = f[x][0] = par;
dep[x] = dep[par] + 1;
idx[x] = ++cnt;
add(cnt, val);
for(int i = 1; f[x][i - 1]; ++i){
f[x][i] = f[f[x][i - 1]][i - 1];
}
for(int i = head[x]; i; i = e[i].nxt){
if(par != e[i].v)
dfs(e[i].v, x, e[i].val);
}
r[x] = cnt;
add(cnt + 1, -val);
}
int lca(int x, int y)
{
if(dep[x] < dep[y])swap(x, y);
int h = dep[x] - dep[y];
for(int i = 19; i >= 0; --i){
if(h & (1 << i))
x = f[x][i];
}
if(x == y)return x;
for(int i = 19; i >= 0; --i){
if(f[x][i] != f[y][i]){
x = f[x][i];
y = f[y][i];
}
}
return f[x][0];
}
long long dis(int x, int y)
{
int z = lca(x, y);
return query(idx[x]) + query(idx[y]) - query(idx[z]) * 2;
}
int X[maxn], Y[maxn], W[maxn];
int main()
{
cin>>t;
while(t--){
scanf("%d%d", &n, &q);
for(int i = 0; i <= n; i++){
head[i] = 0;
fa[i] = i;
sum[i] = 0;
}
cnt = 0;
tot = 0;
int r1 = 0, r2 = 0, bw = 0, id;
for(int i = 1; i <= n; i++){
int x, y, w;
scanf("%d%d%d", &x, &y, &w);
if(find(x) == find(y)){
r1 = x;
r2 = y;
bw = w;
id = i;
}
else{
addedge(x, y, w);
addedge(y, x, w);
fa[find(x)] = find(y);
}
X[i] = x;
Y[i] = y;
W[i] = w;
}
dfs(1, 0, 0);
while(q--){
int op, x, y;
scanf("%d%d%d", &op, &x, &y);
if(op == 0){
if(id == x)bw = y;
else{
int u = (fa[X[x]] == Y[x]?X[x]:Y[x]);
add(idx[u], -W[x] + y);
add(r[u] + 1, W[x] - y);
W[x] = y;
}
}
else{
long long ans = dis(x, y);
ans = min(ans, dis(r1, x) + dis(r2, y) + bw);
ans = min(ans, dis(r1, y) + dis(r2, x) + bw);
printf("%lld\n", ans);
}
}
}
return 0;
}
hdu6393Traffic Network in Numazu【树状数组】【LCA】的更多相关文章
- HDU 5293 Tree chain problem 树形dp+dfs序+树状数组+LCA
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=5293 题意: 给你一些链,每条链都有自己的价值,求不相交不重合的链能够组成的最大价值. 题解: 树形 ...
- HDU4836 The Query on the Tree(树状数组&&LCA)
由于智力的问题,百度之星完全lu不动..开场看第一题根据题目给的条件我觉得一定是可以构造出来的,题目给的意思颇有鸽巢原理的感觉,于是觉得开场第一题应该就是智力构造题了,想了半个小时,发现完全想不动,于 ...
- BZOJ3881[Coci2015]Divljak——AC自动机+树状数组+LCA+dfs序+树链的并
题目描述 Alice有n个字符串S_1,S_2...S_n,Bob有一个字符串集合T,一开始集合是空的. 接下来会发生q个操作,操作有两种形式: “1 P”,Bob往自己的集合里添加了一个字符串P. ...
- HDU 5293 Annoying problem 树形dp dfs序 树状数组 lca
Annoying problem 题目连接: http://acm.hdu.edu.cn/showproblem.php?pid=5293 Description Coco has a tree, w ...
- 【BZOJ2819】Nim 树状数组+LCA
[BZOJ2819]Nim Description 著名游戏设计师vfleaking,最近迷上了Nim.普通的Nim游戏为:两个人进行游戏,N堆石子,每回合可以取其中某一堆的任意多个,可以取完,但不可 ...
- 【BZOJ4999】This Problem Is Too Simple! 离线+树状数组+LCA
[BZOJ4999]This Problem Is Too Simple! Description 给您一颗树,每个节点有个初始值. 现在支持以下两种操作: 1. C i x(0<=x<2 ...
- [CSP-S模拟测试]:异或(树状数组+LCA)
题目传送门(内部题21) 输入格式 第一行一个字符串$str$,表示数据类型.第二行一个正整数$k$,表示集合$K$的大小,保证$k>1$.接下来$k$行每行$k$个数,第$i$行第$j$个数表 ...
- POJ 2763"Housewife Wind"(DFS序+树状数组+LCA)
传送门 •题意 一对夫妇居住在 xx村庄,给村庄有 $n$ 个小屋: 这 $n$ 个小屋之间有双向可达的道路,不会出现环,即所构成的图是个树: 从 $a_i$ 小屋到 $b_i$ 小屋需要花费 $w_ ...
- Codeforces 1111E DP + 树状数组 + LCA + dfs序
题意:给你一颗树,有q次询问,每次询问给你若干个点,这些点可以最多分出m组,每组要满足两个条件:1:每组至少一个点,2:组内的点不能是组内其它点的祖先,问这样的分组能有多少个? 思路:https:// ...
- BZOJ 2819: Nim( nim + DFS序 + 树状数组 + LCA )
虽然vfleaking好像想卡DFS...但我还是用DFS过了... 路径上的石堆异或和=0就是必败, 否则就是必胜(nim游戏). 这样就变成一个经典问题了, 用DFS序+BIT+LCA就可以在O( ...
随机推荐
- nginx配置设置,使部分页面访问跳转到404页面
location ~* /(ask|hospital|wenda|regsearch|user|doctor) { return ; } error_page /.html;
- C#------Aspose的License文件
Aspose官网: https://docs.aspose.com/display/cellsnet/Home 下载地址: http://vdisk.weibo.com/s/uoya0tRiZNf0X ...
- UVA 1232 - SKYLINE(线段树)
UVA 1232 - SKYLINE option=com_onlinejudge&Itemid=8&page=show_problem&category=502&pr ...
- 8 -- 深入使用Spring -- 3...1 Resource实现类ClassPathResource
8.3.1 Resource实现类------ClassPathResource : 访问类加载路径下的资源的实现类 2.访问类加载路径下的资源 ClassPathResource 用来访问类加载路径 ...
- [AX2012]关于财务默认维度
和以前的版本一样,AX2012中很多地方都使用财务维度,比如客户.销售订单.销售订单行等,根据相应的财务维度设置,生成的相应财务分录将带有财务维度,方便后续对财务分录交易的分析.下图是在客户记录上设置 ...
- git push 问题汇总
Q:git push时卡死 这个问题找的快要放弃的时候... A: git config --global http.postBuffer [via] Q:git push 报错 Counting o ...
- Ansible 如何查看模块文档
[root@localhost ~]$ ansible-doc -l # 列出所有模块 [root@localhost ~]$ ansible-doc cron # 查看指定模块的文档
- (数字IC)低功耗设计入门(一)——低功耗设计目的与功耗的类型
低功耗设计这个专题整理了好久,有一个月了,有图有证据: 然而最近一直有些烦心事.郁闷事,拖延了一下,虽然现在还是有点烦,但是还是先发表了吧.下面我们就来聊聊低功耗设计吧,由于文章比较长,因此我就不一次 ...
- VMware 14 的永久许可密钥
VMware workstation 14永久激活密钥分享: CG54H-D8D0H-H8DHY-C6X7X-N2KG6 ZC3WK-AFXEK-488JP-A7MQX-XL8YF AC5XK-0ZD ...
- Myeclipse10使用git
用Myeclipse安装egit,使用官网最新地址或者下载最新的egit插件到本地安装均在team中看不到git,最后发现到http://download.eclipse.org/egit/updat ...