PAT 甲级 1072 Gas Station (30 分)(dijstra)
A gas station has to be built at such a location that the minimum distance between the station and any of the residential housing is as far away as possible. However it must guarantee that all the houses are in its service range.
Now given the map of the city and several candidate locations for the gas station, you are supposed to give the best recommendation. If there are more than one solution, output the one with the smallest average distance to all the houses. If such a solution is still not unique, output the one with the smallest index number.
Input Specification:
Each input file contains one test case. For each case, the first line contains 4 positive integers: N (≤), the total number of houses; M (≤), the total number of the candidate locations for the gas stations; K (≤), the number of roads connecting the houses and the gas stations; and DS, the maximum service range of the gas station. It is hence assumed that all the houses are numbered from 1 to N, and all the candidate locations are numbered from G
1 to G
M.
Then K lines follow, each describes a road in the format
P1 P2 Dist
where P1
and P2
are the two ends of a road which can be either house numbers or gas station numbers, and Dist
is the integer length of the road.
Output Specification:
For each test case, print in the first line the index number of the best location. In the next line, print the minimum and the average distances between the solution and all the houses. The numbers in a line must be separated by a space and be accurate up to 1 decimal place. If the solution does not exist, simply output No Solution
.
Sample Input 1:
4 3 11 5
1 2 2
1 4 2
1 G1 4
1 G2 3
2 3 2
2 G2 1
3 4 2
3 G3 2
4 G1 3
G2 G1 1
G3 G2 2
Sample Output 1:
G1
2.0 3.3
Sample Input 2:
2 1 2 10
1 G1 9
2 G1 20
Sample Output 2:
No Solution
题意:
给出一个图,其中有 N <= 103 个节点是居民房,M
<= 10 个节点是计划建造加油站的候选点。给出加油站所能服务的最远距离 D。要求计算出合适的位置建造加油站,满足如下优先级条件:
1.所有居民房必须在加油站的服务距离内。
2.所有居民房中距离加油站的最近的居民房与加油站之间的距离是最远的。(大概是安全方面的考虑,加油站要离居民区远一点)
3.所有房间距离加油站的最小距离的总和最小。(节约居民加油的总体成本)
4.同等条件下,序号越小的加油站优先。
题解:
实际上是求加油站到所有点的最短路径的问题,使用 Dijsktra 可以满足。
另外,需要考虑求最短路径的过程中是否要将其他加油站所构建的路径算入在内
思路我很快想到了,但是写的不够熟练,粗心挑了挺久的bug,后来最后的一个测试点没过,原因是输入的时候我用的的char,没有考虑两位数三位数,像G13,2000这种。
AC代码:
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#define inf 0x3f3f3f3f
using namespace std;
int e[][];
int dis[][];//dijstra
int v[];
int n,m,k,ds;
string p;
struct node{
int id;
int mi;
int sum;
}ans[];
bool cmp(node x,node y){
if(x.mi==y.mi){
if(x.sum==y.sum){
return x.id<y.id;
}
return x.sum<y.sum;
}
return x.mi>y.mi;
}
void dijstra(int s){
for(int i=;i<=n+m;i++){
dis[s][i]=e[i][s+n];
}
memset(v,,sizeof(v));
v[s+n]=;
int kk=-;
int mm=inf;
for(int i=;i<=n+m;i++){
kk=-;
mm=inf;
for(int j=;j<=n+m;j++){
if(!v[j]&&dis[s][j]<mm){
mm=dis[s][j];
kk=j;
}
}
if(kk==-) break;
v[kk]=;
for(int j=;j<=n+m;j++){
if(v[j]!=&&dis[s][j]>dis[s][kk]+e[kk][j]){
dis[s][j]=dis[s][kk]+e[kk][j];
}
}
}
}
int main(){
cin>>n>>m>>k>>ds;
for(int i=;i<=n+m;i++){
for(int j=;j<=n+m;j++){
e[i][j]=inf;
if(i==j) e[i][j]=;
}
}
for(int i=;i<=k;i++){
int u=,v=,dd;
cin>>p;//输入不能用char,可能会出现G11,199这样的数字
if(p[]=='G'){
for(int j=;j<p.length();j++){
u=u*+p[j]-'';
}
u+=n;
}else{
for(int j=;j<p.length();j++){
u=u*+p[j]-'';
}
}
cin>>p;
if(p[]=='G'){
for(int j=;j<p.length();j++){
v=v*+p[j]-'';
}
v+=n;
}else{
for(int j=;j<p.length();j++){
v=v*+p[j]-'';
}
}
cin>>dd;
if(dd<e[u][v]){
e[u][v]=e[v][u]=dd;
}
}
int num=;//记录备选答案的个数
int f;//标记是否超出范围
for(int i=;i<=m;i++){
dijstra(i);
int min_d=inf;//最小距离
int sum_d=;//距离和
f=;
for(int j=;j<=n;j++){
if(dis[i][j]>ds){//超出范围不放入ans
f=;
break;
}
if(min_d>dis[i][j]){
min_d=dis[i][j];
}
sum_d+=dis[i][j];
}
if(f){
ans[++num].id=i;
ans[num].mi=min_d;
ans[num].sum=sum_d;
}
}
if(num==) cout<<"No Solution";
else{
sort(ans+,ans++num,cmp);
cout<<"G"<<ans[].id<<endl;
printf("%.1f %.1f",ans[].mi*1.0,ans[].sum*1.0/n);
}
return ;
}
PAT 甲级 1072 Gas Station (30 分)(dijstra)的更多相关文章
- pat 甲级 1072. Gas Station (30)
1072. Gas Station (30) 时间限制 200 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue A gas sta ...
- PAT甲级——1072 Gas Station
A gas station has to be built at such a location that the minimum distance between the station and a ...
- PAT Advanced 1072 Gas Station (30) [Dijkstra算法]
题目 A gas station has to be built at such a location that the minimum distance between the station an ...
- 【PAT甲级】1072 Gas Station (30 分)(Dijkstra)
题意: 输入四个正整数N,M,K,D(N<=1000,M<=10,K<=10000)分别表示房屋个数,加油站个数,路径条数和加油站最远服务距离,接着输入K行每行包括一条路的两条边和距 ...
- 1072. Gas Station (30)【最短路dijkstra】——PAT (Advanced Level) Practise
题目信息 1072. Gas Station (30) 时间限制200 ms 内存限制65536 kB 代码长度限制16000 B A gas station has to be built at s ...
- PAT 甲级 1030 Travel Plan (30 分)(dijstra,较简单,但要注意是从0到n-1)
1030 Travel Plan (30 分) A traveler's map gives the distances between cities along the highways, to ...
- PAT 1072. Gas Station (30)
A gas station has to be built at such a location that the minimum distance between the station and a ...
- 1072 Gas Station (30)(30 分)
A gas station has to be built at such a location that the minimum distance between the station and a ...
- 1072. Gas Station (30)
先要求出各个加油站 最短的 与任意一房屋之间的 距离D,再在这些加油站中选出最长的D的加油站 ,该加油站 为 最优选项 (坑爹啊!).如果相同D相同 则 选离各个房屋平均距离小的,如果还是 相同,则 ...
随机推荐
- Linux 安装网络yum地址
rpm -Uhv http://dl.fedoraproject.org/pub/epel/6/x86_64/epel-release-6-8.noarch.rpm rpm -Uhv http:/ ...
- python - ORM 查询
1. 正常查询: ## 效率低,因为每次查询都是查询表和关联表的所有数据 ret = User.objects.all() for item in ret: print(item.name,item. ...
- 洛谷 P1955 [NOI2015]程序自动分析 题解
每日一题 day22 打卡 Analysis 离散化+并查集 先离散化所有的约束条件,再处理所有e=1的条件,将i的祖先和j的祖先合并到一个集合中:e=0时,如果i的祖先与j的祖先在同一个集合中,说明 ...
- C# Dictionary使用
Dictionary<string, int> illegParking = new Dictionary<string, int>(); 键:inData.LOTID 值:i ...
- OPCode详解及汇编与反汇编原理
1. 何为OPCode 在计算机科学领域中,操作码(Operation Code, OPCode)被用于描述机器语言指令中,指定要执行某种操作的那部分机器码,构成OPCode的指令格式和规范由处理器的 ...
- PWM控制灯亮暗的verilog实现
PWM的全称为Pulse-Width Modulation(脉冲宽度调制),即调节脉冲的占空比.当输出的脉冲频率一定时,输出的脉冲占空比越大,相当于输出的有效电平越大,这样也就简单实现了由FPGA来控 ...
- 游戏 DP
游戏 DP [题意描述] 小喵喵喜欢玩 RPG 游戏.在这款游戏中,玩家有两个属性,攻击和防御,现在小喵喵的攻击和防御都是 1,接下来小喵喵会依次遇到 n 个事件.事件有两种. 1.小喵喵经过修炼,角 ...
- 10分钟手把手教你运用Python实现简单的人脸识别
欲直接下载代码文件,关注我们的公众号哦!查看历史消息即可! 前言:让我的电脑认识我 我的电脑只有认识我,才配称之为我的电脑! 今天,我们用Python实现高大上的人脸识别技术! Python里,简单的 ...
- 贪心算法训练(九)——Best Cow Line(字典序最小问题)
原题链接:Best Cow Line 1. 问题描述 2. 输入 6 A C D B C B 3. 输出 ABCBCD 4.思路分析 不断地取原字符串 S 中开头和末尾比较小的字符串放到 T 的末尾 ...
- 基于腾讯云监控 API 的 Grafana App 插件开发
Tencent Cloud Monitor App Grafana 是一个开源的时序性统计和监控平台,支持例如 elasticsearch.graphite.influxdb 等众多的数据源,并以功能 ...