PAT-PAT (Advanced Level) Practise 1018. Public Bike Management (30) 【四星级】

最新推荐文章于 2016-07-24 16:33:21 发布

David_Jett

最新推荐文章于 2016-07-24 16:33:21 发布

阅读量826

点赞数

分类专栏： PAT 编程题——图论编程题——搜索刷PAT，申Offer 文章标签： PAT 图论搜索

本文链接：https://blog.csdn.net/David_Jett/article/details/50015291

版权

编程题——图论同时被 3 个专栏收录

29 篇文章 0 订阅

订阅专栏

PAT

25 篇文章 0 订阅

订阅专栏

刷PAT，申Offer

24 篇文章 32 订阅

订阅专栏

题目链接：http://www.patest.cn/contests/pat-a-practise/1018

题目链接：

1018. Public Bike Management (30)

时间限制

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 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 S₃, we have 2 different shortest paths:

1. PBMC -> S₁ -> S₃. In this case, 4 bikes must be sent from PBMC, because we can collect 1 bike from S₁ and then take 5 bikes to S₃, so that both stations will be in perfect conditions.

2. PBMC -> S₂ -> S₃. 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: C_max (<= 100), always an even number, is the maximum capacity of each station; N (<= 500), the total number of stations; S_p, 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 C_i(i=1,...N) where each C_i is the current number of bikes at S_i respectively. Then M lines follow, each contains 3 numbers: S_i, S_j, and T_ij which describe the time T_ij taken to move betwen stations S_i and S_j. 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->S₁->...->S_p. Finally after another space, output the number of bikes that we must take back to PBMC after the condition of S_pis 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:

Sample Output:

3 0->2->3 0

题目大意：

要求从起点到目标点，找到一条路径，使得该路径最短，并且使得该路径上的点的车数量都达到既定值。若存在多条，则要找到需要从源点运车数最少的，若还存在多条，则选择为那条到达目标点之后，多出的车最少的路径。这里被坑死了，牛客网的数据没有考虑到第二层。

解题：

dfs搜索，到达目标点比较，比较规则详见代码，需要更新，则更新路径。

代码：

#include <iostream>
#include <vector>
#include <cstdio>
#include <cstring>
#define inf 1000000000
using namespace std;
int  num[510],tmp[510],path[510];
int mincost,minbike,maxbike;
int s,c,tt;
vector <int> r[510];
int  mapp[510][510];
bool vis[510];
int  min(int a,int b)
{
  return a<b?a:b;
}
void dfs(int x,int extr,int les,int step,int cost)
{
  int temp;
  vis[x]=1;
  tmp[step]=x;
  if(num[x]>=c)
  {
    extr+=num[x]-c;
  }
  else
  {
    temp=c-num[x];
    if(extr>=temp)
    {
      extr-=temp;
    }
    else
    {
      les+=temp-extr;
      extr=0;
    }
  }
  if(x==s)
  {
    if(cost<mincost)
    {
      mincost=cost;
      minbike=les;
      maxbike=extr;
      tt=step;
      for(int i=0;i<=tt;i++)
        path[i]=tmp[i];
    }
    else if(cost==mincost)
    {
      if(minbike>les)
      {
        minbike=les;
        maxbike=extr;
        tt=step;
         for(int i=0;i<=tt;i++)
            path[i]=tmp[i];
      }
      else if(minbike==les)
      {
        if(extr<maxbike)
        {
          maxbike=extr;
          tt=step;
              for(int i=0;i<=tt;i++)
                path[i]=tmp[i];
        }
      }
    }
    return;
  }
  for(int i=0;i<r[x].size();i++)
  {
    if(!vis[r[x][i]])
    {
      dfs(r[x][i],extr,les,step+1,cost+mapp[x][r[x][i]]);
      vis[r[x][i]]=0;
    }
  }
}
int main()
{
  int n,m,a,b,d;
  scanf("%d%d%d%d",&c,&n,&s,&m);
  for(int i=1;i<=n;i++)
    scanf("%d",&num[i]);
    for(int i=0;i<=n;i++)
      for(int j=0;j<=n;j++)
        mapp[i][j]=inf;
    c/=2;
    mincost=inf;
    minbike=inf;
    memset(vis,0,sizeof(vis));
    for(int i=0;i<m;i++)
    {
      scanf("%d%d%d",&a,&b,&d);
      mapp[a][b]=min(mapp[a][b],d);
      mapp[b][a]=mapp[a][b];
      r[a].push_back(b);
      r[b].push_back(a);
    }
    vis[0]=1;
    tmp[0]=0;
    for(int i=0;i<r[0].size();i++)
    {
      dfs(r[0][i],0,0,1,mapp[0][r[0][i]]);
        vis[r[0][i]]=0;
    }
    printf("%d 0",minbike);
    for(int i=1;i<=tt;i++)
      printf("->%d",path[i]);
    printf(" %d\n",maxbike);
  return 0;
}