【PAT 1001Public Bike Management (30)】+ dfs + dijkstra
来源:互联网 发布:好玩的java源代码 编辑:程序博客网 时间:2024/05/21 22:59
题目描述
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.
输入例子:
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
题意 : 从 0 点 到给的目标点 Sp的最短路径之间,所有的点的自行车数量平衡为 Cmax / 2,需要从 0 点在拿出多少辆自行车,需要拿回多少辆,以及最短路径
思路 : 计算出 0 到 Sp 的最短路径,dfs 更新最优解
AC代码:
#include<cstdio>#include<vector>#include<algorithm>using namespace std;const int MAX = 510;const int INF = 0x3f3f3f3f / 2;int a[MAX],d[MAX][MAX],dis[MAX],vis[MAX],c,n,m,o,ans,sum;vector <int> v[MAX],ve,vv;void dj(){ fill(dis,dis + n + 1,INF); fill(vis,vis + n + 1,0); dis[0] = 0; while(true){ int u = -1; for(int i = 0; i <= n; i++) if(!vis[i] && (u == -1 || dis[u] > dis[i])) u = i; if(u == -1) break; vis[u] = 1; for(int i = 0; i <= n; i++) if(dis[i] > dis[u] + d[i][u]) dis[i] = dis[u] + d[i][u],v[i].clear(),v[i].push_back(u); else if(dis[i] == dis[u] + d[i][u]) v[i].push_back(u); } return ;}void dfs(int x){ vv.push_back(x); if(x == 0){ int nl = 0,pl = 0; for(int i = vv.size() - 1; i >= 0; i--) if(vv[i]){ int w = vv[i]; if(a[w] > c / 2) nl += a[w] - c / 2; else nl -= c / 2 - a[w]; if(nl < 0) pl -= nl,nl = 0; // 必须从 PBMC 发车 } if(pl < ans) ans = pl,sum = nl,ve = vv; else if(pl == ans && nl < sum) sum = nl,ve = vv; return ; } for(int i = 0; i < v[x].size(); i++) dfs(v[x][i]),vv.pop_back(); return ;}int main(){ scanf("%d %d %d %d",&c,&n,&o,&m); for(int i = 1; i <= n; i++) scanf("%d",&a[i]); int x,y,vl; for(int i = 0; i <= n; i++) fill(d[i],d[i] + n + 1,INF); while(m--){ scanf("%d %d %d",&x,&y,&vl); d[x][y] = d[y][x] = vl; } dj(); ans = sum = INF; dfs(o); printf("%d 0",ans); for(int i = ve.size() - 2; i >= 0; i--) printf("->%d",ve[i]); printf(" %d\n",sum); return 0;}
- 【PAT 1001Public Bike Management (30)】+ dfs + dijkstra
- PAT 1018. Public Bike Management (dijkstra + dfs + 剪枝)
- pat 1018. Public Bike Management (dijkstra+dfs)
- PAT-1018 Public Bike Management(dijkstra + dfs)
- PAT Public Bike Management (dfs)
- 1018. Public Bike Management (30)-PAT甲级真题(Dijkstra + DFS)
- PAT 1018. Public Bike Management (30)(Dijkstra,dfs根据pre[]输出路径,双向计算)
- PAT甲级1001-Public Bike Management (30)
- 1018 Public Bike Management --dijkstra+dfs
- PAT 1001 Public Bike Management
- PAT 1018 Public Bike Management DFS+SPFA
- 1018. Public Bike Management (30)-PAT
- PAT A 1018.Public Bike Management (30)
- pat 1018. Public Bike Management (30)
- PAT 1018. Public Bike Management (30)
- PAT 1018. Public Bike Management (30)
- PAT 1018. Public Bike Management (30)
- 【PAT】1018. Public Bike Management (30)
- mysql约束之修改和删除
- 阶乘之和
- 初学java--输出helloworld,转移符以及注释的使用
- tensorflow报错:Shape must be rank 2 but is rank 3 for 'MatMul' (op: 'MatMul')
- 【shell】结构控制-循环语句
- 【PAT 1001Public Bike Management (30)】+ dfs + dijkstra
- Unity3D Vector3.Dot 点乘 与 Vector3.Cross 叉乘
- C++学习笔记之数组
- hdu3072 Intelligence System【强连通】
- jQuery添加节点___例_添加表格
- PAT 1069微博转发抽奖
- Ceres-Solver学习笔记(3)
- 暑期集训之喷水装置一
- 【BZOJ】4554 [Tjoi2016&Heoi2016]游戏 二分图