1018. Public Bike Management (30)
2015-12-06 10:18
495 查看
比较复杂的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 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 1Figure 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 Sp 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:
来源: <http://www.patest.cn/contests/pat-a-practise/1018>
[/code]
来自为知笔记(Wiz)
时间限制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 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 1Figure 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 Sp 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 1Sample Output:
3 0->2->3 0
来源: <http://www.patest.cn/contests/pat-a-practise/1018>
#include<iostream>
#pragma warning(disable:4996)
#include<vector>
using namespace std;
vector<int> route,routeTemp;
int mp[510][510] = { 0 };
int mark[510] = { 0 };
int currentBike[510] = { 0 };
int cmax, n, m, sp;
int TotaltoSend = 0, totalTakeBack = 999999;
int MinLength = 999999;
void dfs(int start, int dist, int length, int tosend, int takeBack,vector<int> road) {
road.push_back(start);
if (start == dist&&length < MinLength) {
MinLength = length;
totalTakeBack = takeBack;
TotaltoSend = tosend;
route.clear();
for (int i = 0; i < road.size(); i++)
route.push_back(road[i]);
return;
}
else if (start == dist&&length == MinLength&&TotaltoSend > tosend) {
totalTakeBack = takeBack;
TotaltoSend = tosend;
route.clear();
for (int i = 0; i < road.size(); i++)
route.push_back(road[i]);
return;
}
else if (start == dist&&length == MinLength&&TotaltoSend == tosend&&takeBack<totalTakeBack) {
totalTakeBack = takeBack;
TotaltoSend = tosend;
route.clear();
for (int i = 0; i < road.size(); i++)
route.push_back(road[i]);
return;
}
else if (start == dist)
return;
for (int i = 1; i <= n; i++) {
if (mark[i] == 0 && mp[start][i] != 0) {
mark[i] = 1;
if (currentBike[i] > cmax / 2) {
//takeBack += currentBike[i] - cmax / 2;
dfs(i, dist, length + mp[start][i], tosend, takeBack + currentBike[i] - cmax / 2, road);
}
else {
if (cmax / 2 - currentBike[i] > takeBack) {
/*tosend += cmax / 2 - currentBike[i]-takeBack;
takeBack = 0;*/
dfs(i, dist, length + mp[start][i], tosend + cmax / 2 - currentBike[i] - takeBack, 0, road);
}
else {
//takeBack = takeBack + currentBike[i] - cmax / 2;
dfs(i, dist, length + mp[start][i], tosend, takeBack + currentBike[i] - cmax / 2, road);
}
}
//dfs(i, dist,length+mp[start][i], tosend, takeBack, road);
mark[i] = 0;
}
}
}
int main(void) {
freopen("Text.txt", "r", stdin);
cin >> cmax >> n >> sp >> m;
for (int i = 1; i <= n; i++) {
cin >> currentBike[i];
}
for (int i = 1; i <= m; i++) {
int s, d, dis;
cin >> s >> d >> dis;
mp[s][d] = mp[d][s] = dis;
}
mark[0] = 1;
dfs(0, sp, 0, 0, 0, routeTemp);
cout << TotaltoSend << " ";
for (int i = 0; i < route.size(); i++) {
cout << route[i];
if (i != route.size() - 1)
cout << "->";
}
cout << " " << totalTakeBack;
return 0;
}
[/code]
来自为知笔记(Wiz)
相关文章推荐
- Linux文件系统代码学习笔记--磁盘格式化&block分配
- linux下 jdk1.8安装
- 小鑫杀怪兽
- 奇妙的23点
- train test 划分 转自 http://blog.sina.com.cn/s/blog_6a90ae320101a5rc.html
- 1017. Queueing at Bank (25)
- 1016. Phone Bills (25)
- 2015年大二上-数据结构-串(3)- 顺序串算法
- Objective-C 零散知识笔记 by STP
- python基本 面向对象
- CSS样式表中的z-index总结
- sqlite数据类型
- 图的基本存储的基本方式三
- 图的基本存储的基本方式二
- android .9.png ”点九” 图片制作方法
- 《1024伐木累》-程序员相亲都做了什么?
- 1015. Reversible Primes (20)
- 图的基本存储的基本方式一
- html 属性大全
- 1014. Waiting in Line (30)