PAT甲级——A1018 Public Bike Management

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:

  1. 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.
  2. 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?? (≤), always an even number, is the maximum capacity of each station; N (≤), 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?? (,) 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. 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
 1 #include <iostream>
 2 #include <algorithm>
 3 #include <vector>
 4 using namespace std;
 5 const int inf = 99999999;
 6 int cmax, n, sp, m;
 7 int minNeed = inf, minBack = inf;
 8 int e[510][510], dis[510], weight[510];
 9 bool visit[510];
10 vector<int> pre[510], path, temppath;
11 void dfs(int v) {
12     temppath.push_back(v);
13     if (v == 0) {
14         int need = 0, back = 0;
15         for (int i = temppath.size() - 1; i >= 0; i--) {
16             int id = temppath[i];
17             if (weight[id] > 0) {
18                 back += weight[id];
19             }
20             else {
21                 if (back > (0 - weight[id])) {
22                     back += weight[id];
23                 }
24                 else {
25                     need += ((0 - weight[id]) - back);
26                     back = 0;
27                 }
28             }
29         }
30         if (need < minNeed) {
31             minNeed = need;
32             minBack = back;
33             path = temppath;
34         }
35         else if (need == minNeed && back < minBack) {
36             minBack = back;
37             path = temppath;
38         }
39         temppath.pop_back();
40         return;
41     }
42     for (int i = 0; i < pre[v].size(); i++)
43         dfs(pre[v][i]);
44     temppath.pop_back();
45 }
46 int main() {
47     fill(e[0], e[0] + 510 * 510, inf);
48     fill(dis, dis + 510, inf);
49     scanf("%d%d%d%d", &cmax, &n, &sp, &m);
50     for (int i = 1; i <= n; i++) {
51         scanf("%d", &weight[i]);
52         weight[i] = weight[i] - cmax / 2;
53     }
54     for (int i = 0; i < m; i++) {
55         int a, b;
56         scanf("%d%d", &a, &b);
57         scanf("%d", &e[a][b]);
58         e[b][a] = e[a][b];
59     }
60     dis[0] = 0;
61     for (int i = 0; i <= n; i++) {
62         int u = -1, minn = inf;
63         for (int j = 0; j <= n; j++) {
64             if (visit[j] == false && dis[j] < minn) {
65                 u = j;
66                 minn = dis[j];
67             }
68         }
69         if (u == -1) break;
70         visit[u] = true;
71         for (int v = 0; v <= n; v++) {
72             if (visit[v] == false && e[u][v] != inf) {
73                 if (dis[v] > dis[u] + e[u][v]) {
74                     dis[v] = dis[u] + e[u][v];
75                     pre[v].clear();
76                     pre[v].push_back(u);
77                 }
78                 else if (dis[v] == dis[u] + e[u][v]) {
79                     pre[v].push_back(u);
80                 }
81             }
82         }
83     }
84     dfs(sp);
85     printf("%d 0", minNeed);
86     for (int i = path.size() - 2; i >= 0; i--)
87         printf("->%d", path[i]);
88     printf(" %d", minBack);
89     return 0;
90 }

原文地址:https://www.cnblogs.com/zzw1024/p/11235709.html

时间: 2024-11-11 09:47:46

PAT甲级——A1018 Public Bike Management的相关文章

PAT 甲级 1018 Public Bike Management (30 分)(dijstra+dfs case 7 过不了求助!!!)

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 Pub

PAT A1018.Public Bike Management

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) kee

A1018. 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) kee

Pat(Advanced Level)Practice--1018(Public Bike Management)

Pat1018代码 题目描述: 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 C

pat 1018 Public Bike Management

题意有三:1.时间最短 2.送出车辆最少 3.回收车辆最少 陷阱有一:调整路径上站点的车辆数目时,不能把后面站点多出来的车辆返补回前面车辆数不够的站点.乍看之下这是符合逻辑的,因为在前面的站点的时候不能知道后面的站点是什么情况,所以按理应该逐个调整合理,后面的站点影响不到前面的调整.但是细想之后发现这其实是很死板的做法,现实当中设计这样一个管理系统肯定能够实时收集每个站点的自行车数,所以在出发前应该就能得出这条路径上总的自行车数目,继而就能得到最优的送出数.但四十是介样子素通不过滴. #incl

PAT Public Bike Management

Public Bike Management 比较复杂 甚入. 我的思路是直接用一个DFS递归回溯做了 关键是题意也比较模糊 注意点如下 1.去的路上可调整,回来不可调整 2.路径最短 3.满足2 且 送出去的车最少 4.满足3 且 拿回来的车最少 AC代码如下 1 #include <stdio.h> 2 #include <stdlib.h> 3 #define MAX 1000000 4 int C,N,Sp,M; 5 int g[501][501]; 6 int flag[

PAT.Public bike management(SPFA + DFS)

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

PAT1018. Public Bike Management

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) ke

1018. Public Bike Management (30)

比较复杂的dfs 注意算好到底需要send多少take back多少 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue 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 an