Pat1018代码

题目描写叙述:

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

AC代码:题目的意思是找路径最短的线路,假设相等则找带来自行车最少的线路,假设再相等则找带走自行车最少的线路;思路,Dijkstra+DFS,本来以为一遍Dijkstra就能够解决的,写到一半时发现。不到目的地根本没法选择路径;由于在选择最短路径的同一时候。还要使须要的自行车数目最少,以及剩余的自行车数目最少,用DSF就能够搞定。

#include<cstdio>
#include<stack>
#include<algorithm>
#define MAX 505
#define INF 0x0FFFFFFF using namespace std; int map[MAX][MAX];
int Station[MAX];
int visited[MAX],Length[MAX];
int FinalPath[MAX],TempPath[MAX];//Path
int flag[MAX][MAX];//DFS flag
int c,n,s,m;
int takein=INF,takeout=INF;//takein to a station,takeout from a station
int finished;//finish flag
int shortdis;//the shortest distance from PBMC to station s
int nowstep,finalstep; void Init(int n)
{
int i,j;
for(i=0;i<=n;i++)
{
Length[i]=INF;
for(j=0;j<=n;j++)
map[i][j]=INF;
}
} void Dijkstra(int n,int d)//计算最短路径
{
int min=INF;
int i,j,k;
int num;
for(i=0;i<=n;i++)
{
Length[i]=map[0][i];
visited[i]=0;
}
Length[0]=0;
visited[0]=1;
for(i=1;i<=n;i++)
{
min=INF;
for(j=0;j<=n;j++)
{
if(!visited[j]&&Length[j]<min)
{
min=Length[j];
k=j;
}
}
visited[k]=1;
for(j=0;j<=n;j++)
{
if(!visited[j]&&Length[j]>min+map[k][j])
{
Length[j]=min+map[k][j];
}
}
}
shortdis=Length[d];
} void Compute()//计算从PBMC到该站须要带来和带走多少辆自行车
{
int in=INF,out=INF;
int i;
int sum=0;
for(i=1;i<=nowstep;i++)
{
sum+=Station[TempPath[i]]-c/2;
if(sum<in)//in表示的是从PBMC到该站的路径时要达到最佳状态须要带来
in=sum; //的自行车数目
}
if(in>0)//不须要带来自行车
in=0;
else
in=-in;
out=sum+in;//须要带出自行车
if(in<takein||(in==takein&&out<takeout))
{
takein=in;
takeout=out;
if(takein==0&&takeout==0)
finished=1;
finalstep=nowstep;
for(i=1;i<=nowstep;i++)//拷贝路径
FinalPath[i]=TempPath[i];
}
} void DFS(int step,int start,int len)
{
int j;
if(finished==1||len>Length[start])
return;
if(len==shortdis&&start==s)
{
nowstep=step;
Compute();
}
for(j=1;j<=n;j++)
{
if(flag[start][j]==1||map[j][start]==INF)
continue;
flag[start][j]=flag[j][start]=1;
TempPath[step+1]=j;
DFS(step+1,j,len+map[start][j]);
flag[start][j]=flag[j][start]=0;
}
} void Display()
{
int i;
printf("%d 0",takein);
for(i=1;i<=finalstep;i++)
printf("->%d",FinalPath[i]);
printf(" %d\n",takeout);
} int main(int argc,char *argv[])
{
int i;
scanf("%d%d%d%d",&c,&n,&s,&m);
Init(n);
for(i=1;i<=n;i++)
scanf("%d",&Station[i]);
for(i=0;i<m;i++)
{
int x,y,len;
scanf("%d%d%d",&x,&y,&len);
map[x][y]=len;
map[y][x]=len;
}
Dijkstra(n,s);
DFS(0,0,0);
Display();
return 0;
}

Pat(Advanced Level)Practice--1018(Public Bike Management)的更多相关文章

  1. PAT 1018 Public Bike Management[难]

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

  2. PAT甲级1018. Public Bike Management

    PAT甲级1018. Public Bike Management 题意: 杭州市有公共自行车服务,为世界各地的游客提供了极大的便利.人们可以在任何一个车站租一辆自行车,并将其送回城市的任何其他车站. ...

  3. PAT 1018 Public Bike Management(Dijkstra 最短路)

    1018. Public Bike Management (30) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yu ...

  4. PAT 甲级 1018 Public Bike Management (30 分)(dijstra+dfs,dfs记录路径,做了两天)

    1018 Public Bike Management (30 分)   There is a public bike service in Hangzhou City which provides ...

  5. PAT (Advanced Level) Practice(更新中)

    Source: PAT (Advanced Level) Practice Reference: [1]胡凡,曾磊.算法笔记[M].机械工业出版社.2016.7 Outline: 基础数据结构: 线性 ...

  6. PAT (Advanced Level) Practice 1001-1005

    PAT (Advanced Level) Practice 1001-1005 PAT 计算机程序设计能力考试 甲级 练习题 题库:PTA拼题A官网 背景 这是浙大背景的一个计算机考试 刷刷题练练手 ...

  7. PAT (Advanced Level) Practice 1046 Shortest Distance (20 分) 凌宸1642

    PAT (Advanced Level) Practice 1046 Shortest Distance (20 分) 凌宸1642 题目描述: The task is really simple: ...

  8. PAT (Advanced Level) Practice 1042 Shuffling Machine (20 分) 凌宸1642

    PAT (Advanced Level) Practice 1042 Shuffling Machine (20 分) 凌宸1642 题目描述: Shuffling is a procedure us ...

  9. PAT (Advanced Level) Practice 1041 Be Unique (20 分) 凌宸1642

    PAT (Advanced Level) Practice 1041 Be Unique (20 分) 凌宸1642 题目描述: Being unique is so important to peo ...

  10. PAT (Advanced Level) Practice 1035 Password (20 分) 凌宸1642

    PAT (Advanced Level) Practice 1035 Password (20 分) 凌宸1642 题目描述: To prepare for PAT, the judge someti ...

随机推荐

  1. selenium.common.exceptions.WebDriverException: Message: u'unknown error: cannot get automation extension\nfrom unknown error: page could not be found: chrome-extension://aapnijgdinlhnhlmodcfapnahmbfeb

    Python2.7 selenium3.4.1在使用chrome driver时报错:selenium.common.exceptions.WebDriverException: Message: u ...

  2. Python Hashlib笔记

    #python3.4hashlib module - A common interface to many hash functions.hash.digest() - Return the dige ...

  3. 关于awk中NR、FNR、NF、$NF、FS、OFS的说明

    一.NR和FNR 1.释义 NR: 表示当前读取的行数 FNR:当前修改了多少行 2.举例 比如现在AWK处理到第五行.第一行没有进行操作,2,3,4,5行进行了操作,那么NR=5,FNR=4 NR= ...

  4. redis安装与安全设置

    redis Redis 是一个开源(BSD许可)的,内存中的数据结构存储系统,它可以用作数据库.缓存和消息中间件 yum安装redis 1.yum安装   #前提得配置好阿里云yum源,epel源 # ...

  5. 3,bool值之间的转换,和str的各个功能属性。

    bool值之间的转换 and 空字符串即为False   字符串内有内容即为True. a = 11 c = str(a) #int转换成str print(type(c)) a = ' b = in ...

  6. mysql数据库修改字段类型

    修改字段类型: alter table 表名 modify column 字段名字 decimal(18, 4) ;

  7. [uiautomator篇]recent

    def Recent(self): d = Device('9410519008004c22098b') displayWidth = int(d.info.get("displayWidt ...

  8. php(ajax)异步刷新(转)

    第一种方法,ajax实现:当然,ajax使用起来确实很简单就可以实现,但是里面的很多知识还是比较有点深的.我之前做页面时间自动刷新的功能就是用的ajax.完整代码是:1.getTime.php: 复制 ...

  9. BZOJ 1009 [HNOI2008]GT考试 ——矩阵乘法 KMP

    先用KMP处理所有的转移,或者直接暴力也可以. 然后矩阵快速幂即可. #include <cstdio> #include <cstring> #include <ios ...

  10. bzoj2850巧克力王国

    巧克力王国 Time Limit: 60 Sec  Memory Limit: 512 MBSubmit: 861  Solved: 325[Submit][Status][Discuss] Desc ...