PAT 1018. Public Bike Management (30)

链接：https://www.nowcoder.com/questionTerminal/4b20ed271e864f06ab77a984e71c090f
来源：牛客网

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.

输入描述:

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.

 

输出描述:

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.

示例1

输入

10 3 3 5
6 7 0
0 1 1
0 2 1
0 3 3
1 3 1
2 3 1

输出

3 0->2->3 0

 

 

这个题意真的很绕啊！看第一遍感觉总有些条件没给清楚 这篇算是要逐字逐句翻译的 阿西吧

题意：有n个共享单车存放点（编号1-n)，和一个维护站编号为0。m条与他们相连的带权边。每一个存放点的最大存储量为cmax，目前每一个存放的的存放量为a[i]

如果一个存放点的存放量为 cmax/2 。那么就认为此时这个存放点最优。

我们需要维护一个存放点id=sp，需要从0到sp进行找一个最优路线 对路线上所有的存放点进行最优维护（维护要保证路线上所有的存放的的存放量都变为最优，即cmax/2)

最优的优先级：首先路线权值和最小，从维护站所带的车辆数最少，维护完带回去的车辆数最少

 

思路：dfs剪枝

每次dfs一条路线，并判断是否比上一次的路线优，如果是则更新，并记录下路线

我们需要把每经过一个存放点的 需要take和back的数目计一下

如果当前存放数量多，那么（带回基地的车辆数）back+=多的数目，当遇到下一个存放数少的存放的，就可以把back的给他。

如果当前存放数量少，如果此前有多余的back，那么分配给他，不够的就（刚开始从基地拿走的车的数量）take+=不够的车辆

 

看代码把TAT

#include <cstdio>
#include <algorithm>
#include <math.h>
#include <string.h>
#include <vector>
#include <iostream>
#define ll long long
#define INF 0x3f3f3f
using namespace std;
const int N=500+500;
vector<int> v[N];
int b[N],vis[N],ans[N],a[N],s[N][N];
int cmax,badid,n,m;
int anstime,ansback,anstake,len;
void dfs(int x,int backk,int take,int id,int time)
{
    int to,i;
    b[id]=x;
    if(time>anstime) return ;
    if(x==badid)
    {
       // printf("----%d %d %d\n",time,anstime,backk);
        if(time<anstime ||( time==anstime && take<anstake )|| (time==anstime && take==anstake && backk<ansback))
        {
            anstime=time;
            len=id;
            for(i=0;i<=id;i++) ans[i]=b[i];
            ansback=backk;
            anstake=take;
        }
        return ;
    }
    for(i=0;i<v[x].size();i++)
    {
        to=v[x][i];
       // if(x==3 && to==4) printf("---%d %d\n",backk,take);
        if(!vis[to])
        {
            vis[to]=1;
            if(a[to]>=cmax/2) dfs(to,backk+a[to]-cmax/2,take,id+1,time+s[x][to]);
            else
            {
                if(backk>=cmax/2-a[to])
                    dfs(to,backk-cmax/2+a[to],take,id+1,time+s[x][to]);
                else
                    dfs(to,0,take+cmax/2-a[to]-backk,id+1,time+s[x][to]);
            }
            vis[to]=0;
        }
    }
}
int main()
{
    int i,uu,vv,w;
    anstime=INF;
    scanf("%d%d%d%d",&cmax,&n,&badid,&m);
    for(i=1;i<=n;i++) scanf("%d",&a[i]);
    a[0]=0;
    for(i=1;i<=m;i++)
    {
        scanf("%d%d%d",&uu,&vv,&w);
        s[uu][vv]=s[vv][uu]=w;
        v[uu].push_back(vv);
        v[vv].push_back(uu);
    }
    vis[0]=1;
    dfs(0,0,0,0,0);
    printf("%d ",anstake);
    for(i=0;i<len;i++) printf("%d->",ans[i]);
    printf("%d ",ans[len]);
    printf("%d\n",ansback);
    return 0;
}