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 S3, we have 2 different shortest paths:
-
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.
-
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 1
Sample Output:
3 0->2->3 0
作者: CHEN, Yue
单位: 浙江大学
时间限制: 400 ms
内存限制: 64 MB
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int inf = 999999,maxn=521;
int minNeed = inf, minBack = inf;
bool visit[maxn];
int e[maxn][maxn], weight[maxn],dis[maxn],cmax,n,sp,m;
vector<int> pre[maxn],path,temppath;//pre存储每个节点的最短路径的前驱节点
void dfs(int v)
{
temppath.push_back(v);
if (v==0)
{
int need = 0, back = 0,temppathSize=temppath.size();//c++prime有说明最好不要写在for里,因为有无符号类型不一致,如果有负数 会出错
for (int i = temppathSize-1; i >=0; i--)
{
int id = temppath[i];
if (weight[id]>0)
{
back += weight[id];
}
else
{
if (back>(0-weight[id]))//back能满足缺少的
{
back += weight[id];
}
else//back满足不了,那就需要从pbmc发一些车子
{
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;
}
int size = pre[v].size();
for (int i = 0; i < size; i++)//v点最短路径不止一条,遍历每条最短路径的前一个节点
{
dfs(pre[v][i]);
}
temppath.pop_back();
}
int main()
{
//freopen("in.txt", "r", stdin);
fill(e[0], e[0] + maxn * maxn, inf);
fill(dis, dis + maxn, inf);
scanf("%d %d %d %d", &cmax, &n, &sp, &m);
for (int i = 1; i <= n; i++)//这种细节一定要小心谨慎,从1开始的啊 找了半天错误 草
{
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);//当时我还在奇怪 为何读入e[a][b]的时候 不用一个scanf,若用一个scanf,a、b的赋值还没完成就使用了ab,造成使用未初始化变量ab的错误
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)
{
minn = dis[j];
u = j;
}
}
if (u==-1)//全都进入集合S了,即全都确定过最短路径了
{
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();
pre[v].push_back(u);
}
else if (dis[v]==dis[u]+e[u][v])
{
pre[v].push_back(u);
}
}
}
}
dfs(sp);
//output
printf("%d 0", minNeed);
int pathsize = path.size();
for (int i = pathsize-2;i>=0;i--)
{
printf("->%d", path[i]);
}
printf(" %d", minBack);
return 0;
}