【PAT】A1018 Public Bike Management【Dijkstra算法】【DFS】

There is a public bike service in Hangzhou City which provides great convenience to the tourists from all over the world. One may rent a bike at any station and return it to any other stations in the city.

The Public Bike Management Center (PBMC) keeps monitoring the real-time capacity of all the stations. A station is said to be in perfect condition if it is exactly half-full. If a station is full or empty, PBMC will collect or send bikes to adjust the condition of that station to perfect. And more, all the stations on the way will be adjusted as well.

When a problem station is reported, PBMC will always choose the shortest path to reach that station. If there are more than one shortest path, the one that requires the least number of bikes sent from PBMC will be chosen.

The above figure illustrates an example. The stations are represented by vertices and the roads correspond to the edges. The number on an edge is the time taken to reach one end station from another. The number written inside a vertex S is the current number of bikes stored at S. Given that the maximum capacity of each station is 10. To solve the problem at S​3​​, we have 2 different shortest paths:

PBMC -> S​1​​ -> S​3​​. In this case, 4 bikes must be sent from PBMC, because we can collect 1 bike from S​1​​ and then take 5 bikes to S​3​​, so that both stations will be in perfect conditions.
PBMC -> S​2​​ -> S​3​​. This path requires the same time as path 1, but only 3 bikes sent from PBMC and hence is the one that will be chosen.

Input Specification:

Each input file contains one test case. For each case, the first line contains 4 numbers: C​max​​ (≤100), always an even number, is the maximum capacity of each station; N (≤500), the total number of stations; S​p​​, the index of the problem station (the stations are numbered from 1 to N, and PBMC is represented by the vertex 0); and M, the number of roads. The second line contains N non-negative numbers C​i​​ (i=1,⋯,N) where each C​i​​ is the current number of bikes at S​i​​ respectively. Then M lines follow, each contains 3 numbers: S​i​​, S​j​​, and T​ij​​ which describe the time T​ij​​ taken to move betwen stations S​i​​ and S​j​​. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print your results in one line. First output the number of bikes that PBMC must send. Then after one space, output the path in the format: 0−>S​1​​−>⋯−>S​p​​. Finally after another space, output the number of bikes that we must take back to PBMC after the condition of S​p​​ is adjusted to perfect.

Note that if such a path is not unique, output the one that requires minimum number of bikes that we must take back to PBMC. The judge’s data guarantee that such a path is unique.

Sample Input:

10 3 3 5
6 7 0
0 1 1
0 2 1
0 3 3
1 3 1
2 3 1

Sample Output:

3 0->2->3 0

题目大意

题目给出每个站点的容纳量、站点总数和需要调节的站点编号，并给出各站点间的路径信息。在前往目的站点时总选择最短路径，并调节途中所有结点到完美状态（使其数量为容纳量的一半），如果有多条最短路径则选择需要从中心携带最少自行车的路径。并将该路径输出。

思路

• 对数据进行预处理，bike[i]存储站点编号为i的车站相对于完美状态所需的车辆（如果值为负数代表多出的数量）。
• 使用Dijkstra算法得到最短路径树。
• 使用dfs遍历，遍历过程中使用temp数组来保存当前遍历的临时路径。对于临时路径，逆向遍历，使用need和total两个计数器，对路径上的任意一个结点u,：
  • 对于need，取Max(0, need + bike[u])。need如果为负数，说明逆向考虑到#u车站时，车辆数相对于完美状态更多，但是由于不能逆向调度（即从起点开始， 先经过的车站的车可以调度给后面的车站，反之不允许），所以这部分多出来的车辆不能累计到前面的车站。所以将need置为0。
  • 对于total，简单累加路径上的需求数。取反为多余车辆数，再加上从车站调度出来的车辆数（最终的need），即得到最终带回起始站的车辆数。

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <climits>
#include <cmath>
using namespace std;
typedef pair<int, int> Edge;
#define maxN 501
int cMax, n, m;
vector<Edge> graph[maxN];
int distTo[maxN];
vector<</