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 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
难度有点大，暂时就不粘上自己的代码了（都是先要保存最短路径相等的节点，然后再根据车辆回收大小进行选择，无法只用Dijkstra算法，还要结合DFS）
题目大意：每个自行车车站的最大容量为一个偶数cmax，如果一个车站里面自行车的数量恰好为cmax / 2，那么称处于完美状态。如果一个车展容量是满的或者空的，控制中心（处于结点0处）就会携带或者从路上手机一定数量的自行车前往该车站，一路上会让所有的车展沿途都达到完美。现在给出cmax，车站的数量n，问题车站sp，m条边，还有距离，求最短路径。如果最短路径有多个，求能带的最少的自行车数目的那条。如果还是有很多条不同的路，那么就找一个从车站带回的自行车数目最少的。带回的时候是不调整的
分析：Dijkstra + DFS。如果只有Dijkstra是不可以的，因为minNeed和minBack在路径上的传递不满足最优子结构，不是简单的相加的过程，只有在所有路径都确定了之后才能区选择最小的need和最小的back
Dijkstra求最短路径，dfs求minNeed和minBack和path，dfs的时候模拟一遍需要调整的过程，求出最后得到的need和back，与minNeed和minBack比较然后根据情况更新path，最后输出minNeed path 和 minBack，记得path是从最后一个结点一直到第一个结点的，所以要倒着输出~
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
const int inf = 99999999;
int cmax, n, sp, m;
int minNeed = inf, minBack = inf;
int e[510][510], dis[510], weight[510];
bool visit[510];
vector<int> pre[510];
vector<int> path, temppath;
void dfs(int v) {
if(v == 0) {
temppath.push_back(v);
int need = 0, back = 0;
for(int i = temppath.size() - 1; i >= 0; i--) {
int id = temppath[i];
if(weight[id] > 0) {
back += weight[id];
} else {
if(back > (0 - weight[id])) {
back += weight[id];
} else {
need += ((0 - weight[id]) - back);
back = 0;
}
}
}
if(need < minNeed) {
minNeed = need;
minBack = back;
path = temppath;
} else if(need == minNeed && back < minBack) {
minBack = back;
path = temppath;
}
temppath.pop_back();
return ;
}
temppath.push_back(v);
for(int i = 0; i < pre[v].size(); i++)
dfs(pre[v][i]);
temppath.pop_back();
}
int main() {
fill(e[0], e[0] + 510 * 510, inf);
fill(dis, dis + 510, inf);
scanf("%d%d%d%d", &cmax, &n, &sp, &m);
for(int i = 1; i <= n; i++) {
scanf("%d", &weight[i]);
weight[i] = weight[i] - cmax / 2;
}
for(int i = 0; i < m; i++) {
int a, b;
scanf("%d%d", &a, &b);
scanf("%d", &e[a][b]);
e[b][a] = e[a][b];
}
dis[0] = 0;
for(int i = 0; i <= n; i++) {
int u = -1, minn = inf;
for(int j = 0; j <= n; j++) {
if(visit[j] == false && dis[j] < minn) {
u = j;
minn = dis[j];
}
}
if(u == -1) break;
visit[u] = true;
for(int v = 0; v <= n; v++) {
if(visit[v] == false && e[u][v] != inf) {
if(dis[v] > dis[u] + e[u][v]) {
dis[v] = dis[u] + e[u][v];
pre[v].clear(); //这里要记得clear
pre[v].push_back(u);
}else if(dis[v] == dis[u] + e[u][v]) {
pre[v].push_back(u);
}
}
}
}
dfs(sp);
printf("%d 0", minNeed);
for(int i = path.size() - 2; i >= 0; i--)
printf("->%d", path[i]);
printf(" %d", minBack);
return 0;
}
题意有三：1.时间最短 2.送出车辆最少 3.回收车辆最少
陷阱有一：调整路径上站点的车辆数目时，不能把后面站点多出来的车辆返补回前面车辆数不够的站点。乍看之下这是符合逻辑的，因为在前面的站点的时候不能知道后面的站点是什么情况，所以按理应该逐个调整合理，后面的站点影响不到前面的调整。但是细想之后发现这其实是很死板的做法，现实当中设计这样一个管理系统肯定能够实时收集每个站点的自行车数，所以在出发前应该就能得出这条路径上总的自行车数目，继而就能得到最优的送出数。但四十是介样子素通不过滴。
#include <iostream>
#include <vector>
#include <fstream>
#include <algorithm>
#define MAX 501
#define INF 0x6FFFFFFF
using namespace std;
struct Path
{//路径
vector<int> station;//路径上的站点
int sent;//该路径需要送出的车辆数
int back;//需要带回的车辆数
};
int map[MAX][MAX];//是否连通
int visited[MAX];//访问标志
int bikes[MAX], dist[MAX];//站点车辆和从PMBC到该站点的最短路径
vector<Path> path;
Path pathTemp;
bool compare(Path p1, Path p2)
{//路径比较，按照送出数和归还数
if(p1.sent<p2.sent)
return true;
else if(p1.sent==p2.sent && p1.back<p2.back)
return true;
else
return false;
}
void Init()
{//初始化状态
for(int i=0; i<MAX; i++)
{
visited[i] = 0;
dist[i] = INF;
for(int j=0; j<MAX; j++)
map[i][j] = 0;
}
}
void Dijkstra(int node, int n)
{//node 为起始节点，n为节点数
for(int i=0; i<n; i++)
dist[i] = INF;//初始距离均设为无穷大
dist[node] = 0;//起始节点距离为0
for(;;)
{
int min = INF;
int num = -1;
for(int i=0; i<n; i++)
{//找到现存未知的距离最小的节点
if(dist[i]<=min && visited[i] == 0)
{ min = dist[i]; num = i;}
}
if(num == -1)
break;
visited[num] = 1;//将该节点标为已知
for(int i=0; i<n; i++)
{
if(!visited[i] && map[i][num]!=0 )
//更新相邻节点路径
if(dist[i] > dist[num]+ map[num][i])
dist[i] = dist[num] + map[num][i];
}
}
}
void DFS(int station, int dest, int _dist, int n)
{//当前站点，目标站点，路径，总站点数
visited[station] = 1;
if(station!=0)
pathTemp.station.push_back(station);//路径更新
if(station == dest)
{
if(_dist == dist[dest]) //到达站点且距离满足dijkstra找到的最短距离
path.push_back(pathTemp);
return;
}
if(_dist>dist[dest])
return;
for(int i=0; i<n; i++)
{
if(!visited[i] && map[station][i]!=0)
{
DFS(i, dest, _dist + map[station][i], n);
pathTemp.station.pop_back();//回调，弹出节点，避免重复写入
visited[i] = 0;
}
}
}
int main(void)
{
//ifstream fin("data.txt");
int bikeMax, stationNum, problemStation, roadNum;
cin>>bikeMax>>stationNum>>problemStation>>roadNum;
Init();//初始化
for(int i=1; i<stationNum+1; i++)
cin>>bikes[i];
for(int i=0; i<roadNum; i++)
{
int station1, station2, time;
cin>>station1>>station2>>time;
map[station1][station2] = time;
map[station2][station1] = time;
}
Dijkstra(0, stationNum+1);//寻求最优路径
for(int i=0; i<stationNum+1; i++)//访问标志复原
visited[i] = 0;
DFS(0, problemStation, 0, stationNum+1);
//计算每个时间最优路径下需要送出和带回的自行车数
int extra;
for(int i=0; i<path.size(); i++)
{
extra = 0;//从路径上前面站点带来的多余车辆
for(int j=0; j<path[i].station.size(); j++)
{
if(bikes[path[i].station[j]]<bikeMax/2)
{
if(extra>=bikeMax/2 - bikes[path[i].station[j]])
extra -= bikeMax/2 - bikes[path[i].station[j]];
else
{
path[i].sent += bikeMax/2 - bikes[path[i].station[j]] - extra;
extra = 0;
}
}
if(bikes[path[i].station[j]]>bikeMax/2)
extra += bikes[path[i].station[j]] - bikeMax/2;
}
path[i].back = extra;
}
sort(path.begin(), path.end(), compare);//按照少送出，少带回的原则排序
cout<<path[0].sent<<" "<<0;
for(int i=0; i<path[0].station.size(); i++)
cout<<"->"<<path[0].station[i];
cout<<" "<<path[0].back;
return 0;
}
扫一扫
1048
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
