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.
![](http://www.patest.cn/upload/11_lrrk0m5o4kg.jpg)
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
DFS VERSION:
#include <iostream>
#include <vector>
using namespace std;
const int SIZE = 501;
int map[SIZE][SIZE];
struct Node{
Node(){
num =0;
dis =-1;
visited = false;
}
int num;
unsigned int dis;
bool visited;
};
Node stations[SIZE];
vector <int> v;
vector <int> s;
int cursend=0;
int curback = 0;
unsigned int minsend=-1,minback=-1,lastdis = -1;
int Cmax;
void findpath(int cur,int d,int dis,int n,vector<int > &v){
if(dis > lastdis)
return;
if(cur == d ){
bool flag = false;
if(dis < lastdis)
flag = true;
else if(dis ==lastdis)
if(cursend < minsend || cursend== minsend && curback < minback)
flag =true;
if(flag){
lastdis = dis;
minsend =cursend;
minback =curback;
s =v;
}
return;
}
for(int j=1;j<=n;j++){
if(map[cur][j] && !stations[j].visited){
stations[j].visited = true;
int lastsend=cursend,lastback=curback;
v.push_back(j);
if(stations[j].num + curback < Cmax/2){
cursend += Cmax/2-(stations[j].num + curback);
curback =0;
}else
curback = stations[j].num + curback - Cmax/2;
findpath(j,d,dis+map[cur][j],n,v);
cursend = lastsend;
curback = lastback;
stations[j].visited = false;
v.pop_back();
}
}
}
void display(int r,vector<int> s,int r2){
printf("%d 0",r);
vector <int>::iterator iter = s.begin();
while(iter != s.end()){
printf("->%d",*iter);
iter++;
}
printf(" %d\n",r2);
}
int main()
{
int N,Sp,M;
// freopen("test.txt","r",stdin);
scanf("%d%d%d%d",&Cmax,&N,&Sp,&M);
for(int i=1;i<=N;i++){
scanf("%d",&stations[i].num);
}
for(int i=0;i<=N;i++)
for(int j=0;j<=N;j++){
map[i][j] = 0;
map[j][i] = 0;
}
for(int i=0;i<M;i++){
int c1,c2,t;
scanf("%d%d%d",&c1,&c2,&t);
map[c1][c2] = t;
map[c2][c1] = t;
}
findpath(0,Sp,0,N,v);
display(minsend,s,minback);
return 0;
}
dijkstra version:
#include <iostream>
#include <vector>
using namespace std;
const int SIZE = 501;
int map[SIZE][SIZE];
struct Node{
Node(){
num =0;
dis =-1;
cnt = 0;
visited = false;
}
int num;
unsigned int dis;
int cnt;
bool visited;
};
Node stations[SIZE];
/*
void Dijkstra(int map[SIZE][],Node stations[],int n){
for(int i=1;i<=n;i++){
stations[i].dis = map[0][i] > 0 ? map[0][i]:-1;
}
// stations[0].visited = true;
stations[0].dis =0;
stations[0].cnt =1;
for(int i=0;i<=n;i++){
int index=0;
unsigned int mindis = -1;
for(int j=0;j<=n;j++){
if(!stations[j].visited && mindis > stations[j].dis){
mindis = stations[j].dis;
index =j;
}
}
stations[index].visited = true;
for(int j=0;j<=n;j+=){
if(map[index][j]){
unsigned int newdis = stations[index].dis + map[index][j];
if(stations[j].dis > newdis){
stations[j].dis = newdis;
stations[j].cnt = stations[index].cnt;
}else if(stations[j].dis == newdis){
stations[j].cnt += stations[index].cnt;
}
}
}
}
}
*/
vector <int> v;
vector <int> s;
int lastacc=0;
int lastsize = 1;
unsigned int lastdis = -1;
int Cmax;
float lastdiff;
void findpath(int cur,int d,int dis,int n,vector<int > &v){
if(dis > lastdis)
return;
if(cur == d ){
if(dis <= lastdis){
lastdis = dis;
int acc=0,size=1;
vector<int>::iterator iter=v.begin();
while(iter != v.end()){
acc += stations[*iter].num;
iter++;
}
size = iter - v.begin();
float diff = acc*1.0/size - Cmax/2;
diff = diff >0 ? diff:-diff;
if(diff < lastdiff){
s=v;
lastacc=acc;
lastsize = size;
lastdiff = diff;
}
}
return;
}
for(int j=1;j<=n;j++){
if(map[cur][j] != -1 && !stations[j].visited){
stations[j].visited = true;
v.push_back(j);
// dis += map[cur][j];
findpath(j,d,dis+map[cur][j],n,v);
// dis -= map[cur][j];
stations[j].visited = false;
v.pop_back();
}
}
}
void display(int r,vector<int> s,int r2){
printf("%d 0",r);
vector <int>::iterator iter = s.begin();
while(iter != s.end()){
printf("->%d",*iter);
iter++;
}
printf(" %d\n",r2);
}
int main()
{
int N,Sp,M;
// freopen("test.txt","r",stdin);
scanf("%d%d%d%d",&Cmax,&N,&Sp,&M);
lastdiff = Cmax/2;
for(int i=1;i<=N;i++){
scanf("%d",&stations[i].num);
}
for(int i=0;i<=N;i++)
for(int j=0;j<=N;j++){
map[i][j] = -1;
map[j][i] = -1;
}
for(int i=0;i<=N;i++)
map[i][i] = 0;
for(int i=0;i<M;i++){
int c1,c2,t;
scanf("%d%d%d",&c1,&c2,&t);
map[c1][c2] = t;
map[c2][c1] = t;
}
// Dijkstra(map,stations,N); //calculate the shortest path
findpath(0,Sp,0,N,v);
// cout <<lastdiff <<' ' <<lastacc <<' ' <<endl;
int remain;
if(lastdiff <=Cmax/2){
remain = lastsize *Cmax/2 - lastacc;
display(remain,s,0);
}else{
remain = lastacc - lastsize *Cmax/2;
display(0,s,remain);
}
return 0;
}