I - Instantaneous Transference POJ - 3592 ，spfa求最长路+tarjan缩点

I - Instantaneous Transference

  POJ - 3592 

It was long ago when we played the game Red Alert. There is a magic function for the game objects which is called instantaneous transfer. When an object uses this magic function, it will be transferred to the specified point immediately, regardless of how far it is.

Now there is a mining area, and you are driving an ore-miner truck. Your mission is to take the maximum ores in the field.

The ore area is a rectangle region which is composed by n × m small squares, some of the squares have numbers of ores, while some do not. The ores can't be regenerated after taken.

The starting position of the ore-miner truck is the northwest corner of the field. It must move to the eastern or southern adjacent square, while it can not move to the northern or western adjacent square. And some squares have magic power that can instantaneously transfer the truck to a certain square specified. However, as the captain of the ore-miner truck, you can decide whether to use this magic power or to stay still. One magic power square will never lose its magic power; you can use the magic power whenever you get there.

Input

The first line of the input is an integer T which indicates the number of test cases.

For each of the test case, the first will be two integers N, M (2 ≤ N, M ≤ 40).

The next N lines will describe the map of the mine field. Each of the N lines will be a string that contains M characters. Each character will be an integer X (0 ≤ X ≤ 9) or a '*' or a '#'. The integer X indicates that square has X units of ores, which your truck could get them all. The '*' indicates this square has a magic power which can transfer truck within an instant. The '#' indicates this square is full of rock and the truck can't move on this square. You can assume that the starting position of the truck will never be a '#' square.

As the map indicates, there are K '*' on the map. Then there follows K lines after the map. The next K lines describe the specified target coordinates for the squares with '*', in the order from north to south then west to east. (the original point is the northwest corner, the coordinate is formatted as north-south, west-east, all from 0 to N - 1,M - 1).

Output

For each test case output the maximum units of ores you can take. 　

Sample Input

1
2 2
11
1*
0 0

Sample Output

3

题解：

建图的话，我们直接把当前的点向右边和下面的2个点建边，然后对于超时空转换到的点，我们也相应的进行建边。（注意#是不可到达的，所以如果边的终点是#，那么这条边不能创建）

图建好以后，我们就得到了一个可能有环的有向图，题目说这个超时空边可以传送无数次，这也就是说，处于一个SCC中的点所有的矿都可以被采集。那么我们很自然的想到了Tarjan缩点。缩完点以后，我们得到了一个DAG，DAG的边权即为目标点的矿数。

现在的任务变成了在DAG上求最长路，有两种方法，记忆化搜索和spfa。我采用的方法是spfa。

代码：