1018. Public Bike Management (30)
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.
Figure 1
Figure 1 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 S3, we have 2 different shortest paths:
1. PBMC -> S1 -> S3. In this case, 4 bikes must be sent from PBMC, because we can collect 1 bike from S1 and then take 5 bikes to S3, so that both stations will be in perfect conditions.
2. PBMC -> S2 -> S3. 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: Cmax (<= 100), always an even number, is the maximum capacity of each station; N (<= 500), the total number of stations; Sp, 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 Ci(i=1,...N) where each Ci is the current number of bikes at Si respectively. Then M lines follow, each contains 3 numbers: Si, Sj, and Tij which describe the time Tij taken to move betwen stations Si and Sj. 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->S1->...->Sp. Finally after another space, output the number of bikes that we must take back to PBMC after the condition of Spis 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 1Sample Output:
3 0->2->3 0
题目解析：
本题要做的分配城市自行车资源，输出分配路线以及供给和回收自行车的数量。
要做的就是：1）寻找最短路径；2）计算供给和回收自行车的数量；3）如果不止一条最短路径，选择供给、回收数量最少的路线。
考察重点：
最短路径搜索算法，题目理解
注意点：
1、相同长度路径选择供给自行车最少的那条，如果供给自行车数量相同则选择回收数量最少的那条。
2、便利节点顺序从起点到终点，累计计算应该供给和回收的自行车数量，注意自行车供给方向只能是从起点到终点。
第一个解法使用DFS算法直接便利寻找最佳路径，第二个解法使用dijkstra算法先计算最短路径，再便利最短路径选择最佳路径。
import java.util.Scanner;
public class Main{
static int min_get = Integer.MAX_VALUE;
static int min_send = Integer.MAX_VALUE;
static int min_len = Integer.MAX_VALUE;
static int[] min_path;
static int[] temp_path;
static int min_path_index = 0;
static int temp_path_index = 0;
static int C;
static int N;
static int P;
static int M;
static int[] gravity;
static int[][] graph;
static boolean[] touch;;
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
C = scanner.nextInt();
N = scanner.nextInt();
P = scanner.nextInt();
M = scanner.nextInt();
gravity = new int[N + 1];
graph = new int[N + 1][N + 1];
touch = new boolean[N + 1];
min_path = new int[N + 1];
temp_path = new int[N + 1];
for (int i = 0; i < N; i++) {
gravity[i + 1] = scanner.nextInt();
}
for (int i = 0; i < N + 1; i++) {
touch[i] = false;
}
for (int i = 0; i < N + 1; i++) {
for (int j = 0; j < N + 1; j++) {
graph[i][j] = 0;
}
}
int a, b, t;
for (int i = 0; i < M; i++) {
a = scanner.nextInt();
b = scanner.nextInt();
t = scanner.nextInt();
graph[a][b] = t;
graph[b][a] = t;
}
scanner.close();
touch[0] = true;
dfs(0, 0);
StringBuffer sb = new StringBuffer();
sb.append(0);
for (int i = 0; i < min_path_index; i++) {
sb.append("->" + min_path[i]);
}
System.out.println(min_send + " " + sb.toString() + " " + min_get);
}
static void dfs(int index, int len) {
if (index == P) {
int get = 0;
int send = 0;
for (int i = 0; i < temp_path_index; i++) {
int j = temp_path[i];
if (get + gravity[j] >= C / 2) {
get = get + gravity[j] - C / 2;
} else {
send += C / 2 - get - gravity[j];
get = 0;
}
}
if (len < min_len || (len == min_len && send < min_send)
|| (len == min_len && send == min_send && get < min_get)) {
min_send = send;
min_get = get;
min_len = len;
for (int i = 0; i < temp_path_index; i++) {
min_path[i] = temp_path[i];
}
min_path_index = temp_path_index;
}
return;
}
for (int i = 0; i <= N; i++) {
if (index != i && graph[index][i] != 0 && !touch[i]) {
touch[i] = true;
temp_path[temp_path_index] = i;
temp_path_index++;
dfs(i, len + graph[index][i]);
temp_path_index--;
touch[i] = false;
}
}
}
}
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Main {
private static final int UNREACH = 0;
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int C = scanner.nextInt();
int N = scanner.nextInt();
int P = scanner.nextInt();
int M = scanner.nextInt();
int[] gravity = new int[N + 1];
int[][] graph = new int[N + 2][N + 2];
int[] dist = new int[N + 1];
List<ArrayList<Integer>> path = new ArrayList<ArrayList<Integer>>();
ArrayList<Integer> tempList = new ArrayList<Integer>();
boolean[] touch = new boolean[N + 1];
for (int i = 0; i < N; i++) {
gravity[i + 1] = scanner.nextInt();
}
for (int i = 0; i < N + 1; i++) {
dist[i] = Integer.MAX_VALUE;
tempList = new ArrayList<Integer>();
tempList.add(N + 1);
path.add(tempList);
touch[i] = false;
}
for (int i = 0; i < N + 2; i++) {
for (int j = 0; j < N + 2; j++) {
graph[i][j] = UNREACH;
}
}
int a, b, t;
for (int i = 0; i < M; i++) {
a = scanner.nextInt();
b = scanner.nextInt();
t = scanner.nextInt();
graph[a][b] = t;
graph[b][a] = t;
if (a == 0) {
tempList = new ArrayList<Integer>();
tempList.add(a);
path.set(b, tempList);
dist[b] = t;
}
}
scanner.close();
Dijkstra(N, graph, dist, path, touch);
String bestPath = "";
List<String> pathStringList = new ArrayList<String>();
findPath(pathStringList, path, "" + P);
int min_get = Integer.MAX_VALUE;
int min_send = Integer.MAX_VALUE;
for (String pathString : pathStringList) {
int get = 0;
int send = 0;
for (String s : pathString.split(" ")) {
int i = Integer.valueOf(s).intValue();
if (get + gravity[i] >= C / 2) {
get = get + gravity[i] - C / 2;
} else {
send += C / 2 - get - gravity[i];
get = 0;
}
}
if (send < min_send || (send == min_send && get < min_get)) {
min_send = send;
min_get = get;
bestPath = pathString;
}
}
StringBuffer sb = new StringBuffer();
sb.append("0");
for (String s : bestPath.split(" ")) {
sb.append("->" + s);
}
System.out.println(min_send + " " + sb.toString() + " " + min_get);
}
private static void Dijkstra(int N, int[][] graph, int[] dist, List<ArrayList<Integer>> path, boolean[] touch) {
ArrayList<Integer> tempList;
touch[0] = true;
dist[0] = 0;
tempList = new ArrayList<Integer>();
tempList.add(0);
path.set(0, tempList);
int count = 1;
while (count < N + 1) {
int min_len = Integer.MAX_VALUE;
int min_index = -1;
for (int i = 0; i < N + 1; i++) {
if (!touch[i] && dist[i] < min_len) {
min_len = dist[i];
min_index = i;
}
}
touch[min_index] = true;
count++;
for (int i = 0; i < N + 1; i++) {
if (touch[i] == false && graph[min_index][i] != UNREACH) {
if (dist[min_index] + graph[min_index][i] < dist[i]) {
dist[i] = dist[min_index] + graph[min_index][i];
tempList = new ArrayList<Integer>();
tempList.add(min_index);
path.set(i, tempList);
} else if (dist[min_index] + graph[min_index][i] == dist[i]) {
tempList = path.get(i);
tempList.add(min_index);
path.set(i, tempList);
}
}
}
}
}
static void findPath(List<String> pathStringList, List<ArrayList<Integer>> path, String currentPath) {
int index = currentPath.charAt(0) - '0';
ArrayList<Integer> tempList = path.get(index);
if (index == 0) {
currentPath = currentPath.substring(2);
pathStringList.add(currentPath);
return;
}
for (int i = 0; i < tempList.size(); i++) {
findPath(pathStringList, path, tempList.get(i) + " " + currentPath);
}
}
}
280
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
