hdu 5934 Bomb(tarjan缩点)

Problem Description
There are N bombs needing exploding.

Each bomb has three attributes: exploding radius ri, position (xi,yi) and lighting-cost ci which means you need to pay ci cost making it explode.

If a un-lighting bomb is in or on the border the exploding area of another exploding one, the un-lighting bomb also will explode.

Now you know the attributes of all bombs, please use the minimum cost to explode all bombs.

 

Input
First line contains an integer T, which indicates the number of test cases.

Every test case begins with an integers N, which indicates the numbers of bombs.

In the following N lines, the ith line contains four intergers xi, yi, ri and ci, indicating the coordinate of ith bomb is (xi,yi), exploding radius is ri and lighting-cost is ci.

Limits
1T20
1N1000
108xi,yi,ri108
1ci104

 

Output
For every test case, you should output ‘Case #x: y’, where x indicates the case number and counts from 1 and y is the minimum cost.

 

Sample Input
1
5
0 0 1 5
1 1 6
0 1 1 7
3 0 2 10
5 0 1 4
Sample Output
Case #1: 15
tarjan求出强连通分量后缩点,从入度为0的连通块内取代价最小的引爆即可。水题一道,结果我沙茶的求距离用的double、、、、

 

发表评论

电子邮件地址不会被公开。 必填项已用*标注