【HDU5770】【线段树】【扫描线】Treasure 题解

最新推荐文章于 2017-11-30 19:54:01 发布

MaverickFW

最新推荐文章于 2017-11-30 19:54:01 发布

阅读量597

点赞数

文章标签： HDU 扫描线线段树

本文链接：https://blog.csdn.net/MaverickFW/article/details/55005851

版权

题目描述了一张由N个节点和N-1条双向道路组成的宝物地图，玩家从节点A出发到节点B，途中收集钥匙并打开对应宝箱获取最大价值。输入包含多个测试用例，每个用例包含节点数、宝物数、道路和宝箱信息。玩家需规划最佳路径，求解所能获得的最大宝物总价值。样例给出了两组输入和输出。

摘要由CSDN通过智能技术生成

Treasure

?? has got a treasure map,the treasure map consists of N nodes,there are N-1 bidirectional roads, Each of them connects a pair of nodes,the N nodes are all connected by the N-1 bidirectional roads.?? can travel through the roads.
There are M treasures in some node. Each treasure has a value, treasures are put into boxs,each treasure corresponds to a box and each box corresponds to a key which is also in some node. Now ?? wants to plan a simple path, the path’s start point is node A,and the path’s destination is node B,?? will go from node A to node B. When ?? goes through a node(including node A and node B), he must first collects all keys, and then must open the boxes he can open in this node. The keys he got never disappear during the travel. Now ?? wants to know the maximum value he could get if he plan a best path.Can you help him?

Input
The first line of the input gives the number of case T,T test cases follow.
Each case first line contains two integer n,m(n,m<=100000)indicating the number of nodes and the number of treasures.
Next n-1 lines each line contains two numbers ui and vi(1<=ui,vi<=n) indicates that there’s one road connecting node ui node vi.
Next m lines each line contains three number ui,vi,wi(1<=ui,vi<=n,-1000<=wi<=1000) indicates the position of ith-box’s key and the position of ith-box, and the value of treasure in the ith-box.

T<=30
The sum of n in all the test cases is no more than 600000
The sum of m in all the test cases is no more than 600000

Output
For each that case output”Case #x: y”,where x is the test case number(starting from 1),and y is the answer you get for that case.
Sample Input
2
4 2
1 2
2 3
3 4
1 1 100
2 4 -5
4 3
1 2
1 3
1 4
2 1 1
1 3 2
1 3 5
Sample Output
Case #1: 100
Case #2: 8
扫
附LMY大大的AC代码，蒟蒻不会

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<set>
#include<queue>
#include<algorithm>
#include<vector>
#include<cstdlib>
#include<cmath>
#include<ctime>
#include<stack>
#define rez(i,x,y) for(int i=x;i>=y;i--)
#define res(i,x,y) for(int i=x;i<=y;i++)
#define INF 0x3f3f3f3f
#define maxn 111111
#define ll long long