A1018. 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 1

Sample Output:

3 0->2->3 0
// hahaha.cpp : 定义控制台应用程序的入口点。
//

#include <stdafx.h>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <string>
#include <cstdio>
#include <set>
#include <algorithm>
#include <string.h>

using namespace std;
const int maxv=510;
const int INF=1000000000;
int n,m,cmax,sp,numpath=0,G[maxv][maxv]={0},weight[maxv];
int d[maxv],minneed=INF,minremain=INF;
bool vis[maxv]={false};
vector<int> pre[maxv];
vector<int> tmppath,path;

void dij(int s)
    {
    fill(d,d+maxv,INF);
    for(int i=0;i<=n;i++)
        {pre[i].push_back(i);}

    d[s]=0;
    for(int i=0;i<n;i++)
        {
        int u=-1,min=INF;
        for(int j=0;j<=n;j++)
            {
            if(vis[j]==false&&d[j]<min)
                {
                u=j;
                min=d[j];
                }
            }

         if(u==-1)return;
         vis[u]=true;
         for(int v=0;v<=n;v++)
             {
             if(vis[v]==false&&G[u][v]!=INF)
                 {
                 if(d[u]+G[u][v]<d[v])
                     {
                     d[v]=d[u]+G[u][v];
                     pre[v].clear();
                     pre[v].push_back(u);
                     }
                 else if(d[u]+G[u][v]==d[v])
                     {
                     pre[v].push_back(u);
                     }
                 }
             }

        }

    }

void DFS(int v)

    {
    if(v==0)
        {
        tmppath.push_back(v);
        int need=0,remain=0;
        for(int i=tmppath.size()-1;i>=0;i--)
            {
            int id=tmppath[i];
            if(weight[id]>0)
                {
                remain+=weight[id];
                }
            else
                {
                if(remain>abs(weight[id]))
                    {
                    remain-=abs(weight[id]);
                    }else
                    {
                    need+=abs(weight[id])-remain;
                    remain=0;
                    }
                }
            }
            if(need<minneed)
                {
                minneed=need;
                minremain=remain;
                path=tmppath;
                }
               else if(need==minneed&&remain<minremain)
                {
                minremain=remain;
                path=tmppath;
                }
            tmppath.pop_back();
            return;

        }

    tmppath.push_back(v);
    for(int i=0;i<pre[v].size();i++)
        {
        DFS(pre[v][i]);
        }
    tmppath.pop_back();
    }

int main() {

     scanf("%d%d%d%d",&cmax,&n,&sp,&m);
     int u,v;
     fill(G[0],G[0]+maxv*maxv,INF);
     for(int i=1;i<=n;i++)
         {
         scanf("%d",&weight[i]);
         weight[i]-=cmax/2;
         }
     for(int i=0;i<m;i++)
         {
         scanf("%d%d",&u,&v);
         scanf("%d",&G[u][v]);
        G[v][u]=G[u][v];
         }
     dij(0);
     DFS(sp);
     printf("%d ",minneed);
     for(int i=path.size()-1;i>=0;i--)
         {
         printf("%d",path[i]);
         if(i>0)printf("->");
         }
     printf(" %d",minremain);
     return 0;
}
时间: 2024-10-07 08:23:35

A1018. Public Bike Management (30)的相关文章

PAT 甲级 1018 Public Bike Management (30 分)(dijstra+dfs case 7 过不了求助!!!)

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 Pub

PAT甲级——A1018 Public Bike Management

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) kee

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) kee

1018. Public Bike Management (30)

比较复杂的dfs 注意算好到底需要send多少take back多少 时间限制 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 an

1018 Public Bike Management (30)(30 分)

时间限制400 ms 内存限制65536 kB 代码长度限制16000 B 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 Pu

PAT A1018.Public Bike Management

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) kee

PAT1018. Public Bike Management (30)

题目传送门 分析 Dijstra + DFS搜索,难点在于存在多条最短路径,因此需要用vector<int> pre[N] 记录路径. 代码 自己写的有些问题,有两个数据没过,就不放上来了.下面的代码来自于https://www.liuchuo.net/archives/2373 #include <cstdio> #include <algorithm> #include <vector> using namespace std; const int in

PAT (Advanced Level) 1018. Public Bike Management (30)

先找出可能在最短路上的边,图变成了一个DAG,然后在新图上DFS求答案就可以了. #include<iostream> #include<cstring> #include<cmath> #include<algorithm> #include<cstdio> #include<queue> #include<vector> using namespace std; const int INF=0x7FFFFFFF; co

PAT-1018 Public Bike Management (30)

直接用dijkstra求取,只能拿到22,四个case过不了 #include<stdio.h> #include<stack> using namespace std; int bike_count[510]; int bike_sum[510]; int bike_sum_num[510]; int map[510][510]; bool visited[510]; int d[510]; int pre[510]; int Max=0xffffffff>>1; /