pat 1087. All Roads Lead to Rome (30) 解答

最新推荐文章于 2024-08-30 16:00:44 发布
最新推荐文章于 2024-08-30 16:00:44 发布
阅读量633 收藏
点赞数
分类专栏： 算法 文章标签： pat c++ 算法 编程 dijkstra
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/var1994/article/details/52461544
版权
解决PAT 1087题，寻找从起始城市到罗马的最低成本路线，同时最大化幸福感。输入包含城市数量、路线数量及各城市幸福感，输出最佳路线的唯一性、成本、总幸福感和平均幸福感。
摘要由CSDN通过智能技术生成 
这题和之前一题紧急救援有点像
这里用的变形的dijkstra 每个节点设置一个vector，遇到相同最短路的，就在vector记录来自哪个节点；
这样 dijkstra结束后，就可以从终点往前推出 所有来的最短路径；再对这些路径进行dfs，找到快乐值最大的路径即可；


1087. All Roads Lead to Rome (30)

 
 
 

  
  
  

   
   
   

    
    
    时间限制
   
   
   

   
   
   

    
    
    200 ms

   
   
   

  
  
  

  
  
  

   
   
   

    
    
    内存限制
   
   
   

   
   
   

    
    
    65536 kB

   
   
   

  
  
  

  
  
  

   
   
   

    
    
    代码长度限制
   
   
   

   
   
   

    
    
    16000 B

   
   
   

  
  
  

  
  
  

   
   
   

    
    
    判题程序
   
   
   

   
   
   

    
    
    Standard
   
   
   

  
  
  

  
  
  

   
   
   作者
  
  
  

  
  
  

   
   
   CHEN, Yue

  
  
  

 
 
 

 
 
 

  
  
  
Indeed there are many different tourist routes from our city to Rome. You are supposed to find your clients the route with the least cost while gaining the most happiness.

  
  
  
Input Specification:

  
  
  
Each input file contains one test case. For each case, the first line contains 2 positive integers N (2<=N<=200), the number of cities, and K, the total number of routes between pairs of cities; followed by the name of the starting city. The next N-1 lines each gives the name of a city and an integer that represents the happiness one can gain from that city, except the starting city. Then K lines follow, each describes a route between two cities in the format "City1 City2 Cost". Here the name of a city is a string of 3 capital English letters, and the destination is always ROM which represents Rome.

  
  
  
Output Specification:
最低0.47元/天 解锁文章
var1994
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
1087 All Roads Lead to Rome (30分)
九大于七的博客
07-22 428
Problem: https://pintia.cn/problem-sets/994805342720868352/problems/994805379664297984 tags: dij最短路 map映射 大杂烩 Mean: 给出n个城市,m条边,起始城市X,终点城市ROM,求起点到终点的最小花费,花费相同要最大快乐,快乐相同要最少步数(平均值最大).同时求最小花费有几种走法 Solution 输入是城市,所以map(idx) 把城市名和编号映射一下.同时再反向映射(redx) 这样用..
PAT-A1087 All Roads Lead to Rome 题目内容及题解
BourbonWhiskey 的博客
02-06 1284
Indeed there are many different tourist routes from our city to Rome. You are supposed to find your clients the route with the least cost while gaining the most happiness. Input Specification: Each ...
1087. All Roads Lead to Rome (30)解题报告
信道者
10-21 664
代码#include <iostream> #include <cstdio> #include <cstdlib> #include <stack> #include <queue> #include <vector> #include <string> #include <functional> #include <map>#define N 220 #define INF 1000000 us
PTA 1087 All Roads Lead to Rome PAT甲级真题 题目解析
zhuiyisinian的博客
05-09 624
PTA-mooc完整题目解析及AC代码库：PTA（拼题A）-浙江大学中国大学mooc数据结构全AC代码与题目解析（C语言） 其实题目倒是不难，思路也很简单，但是为了练习各种数据结构，我没有使用stl，而是自己从头定义了无向图的邻接表、堆以及哈希表结构，所以代码相对较长。 Indeed there are many different tourist routes from our city to Rome. You are supposed to find your clients the route w
1087 All Roads Lead to Rome (30分)--PAT甲级真题
Samson的博客
05-03 336
Indeed there are many different tourist routes from our city to Rome. You are supposed to find your clients the route with the least cost while gaining the most happiness. Input Specification: Each in...
PTA甲级考试真题练习87——1087 All Roads Lead to Rome
醉等佳人归
04-07 205
题目 思路 hash字符串+图的最短路径（我使用DFS） 代码 #include <iostream> #include <string> #include<algorithm> #include<vector> #include<map> using namespace std; #define nmax 205 #define i...
【PAT刷题甲级】1087.All Roads Lead to Rome
C_greenbird的博客
09-06 257
1087 All Roads Lead to Rome (30 分) Indeed there are many different tourist routes from our city to Rome. You are supposed to find your clients the route with the least cost while gaining the most happiness. Input Specification Each input file contains one
[PAT]1087. All Roads Lead to Rome (30)
qq_36996464的博客
07-28 260
时间限制 200 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Indeed there are many different tourist routes from our city to Rome. You are supposed to find your clients the route with...
PAT甲级1087 All Roads Lead to Rome (30分)|C++实现
weixin_42393947的博客
09-25 274
一、题目描述 原题链接 Indeed there are many different tourist routes from our city to Rome. You are supposed to find your clients the route with the least cost while gaining the most happiness. Input Specification: ​​Output Specification: Sample Input: 6 7 HZH ROM
PAT (Advanced Level) Practice 1087 All Roads Lead to Rome (30 分) 凌宸1642
lingchen1120的博客
08-10 539
PAT (Advanced Level) Practice 1087 All Roads Lead to Rome (30 分) 凌宸1642 题目描述： Indeed there are many different tourist routes from our city to Rome. You are supposed to find your clients the route with the least cost while gaining the most happiness. 译：实际
第八天PAT-A1087 All Roads Lead to Rome算法描述
giggle66的博客
08-22 156
A1087 Description： 从我们的城市到罗马有许多条路，求一条花费最小且获得最多快乐的路径。 Input： 每个测试点一个样例； 首行有两个正整数：城市数N[2,200]，两城市间的路径最条数K，然后是起点的城市名； 接下来N-1行给出了城市名和可以从这个城市获得的幸福值，除了最开始的城市； 接下来K行每行描述了连接两个城市的道路及其花费，城市名是三个大写英语字母，终点是ROM代表了罗马； 6 7 HZH ROM 100 PKN 40 GDN 55 PRS 95 BLN 80 ROM GD
1087 All Roads Lead to Rome (30分) PAT
Ike_Lin的博客
03-03 244
和1003题类似，只不过需要记录更多信息，由于我的1003题的解法已经包含了这些信息，因此只需要将城市名用map映射到对应的数字，就可以用那一题的代码。 #include<cstdio> #include<queue> #include<map> #include<string> #include<iostream> using n...
PAT甲级1087 All Roads Lead to Rome (30 分)题解
qq_40438165的博客
09-04 1723
\quad这个题需要考虑很多因素，第一要求是找出花费最少的路，同时统计这些路的条数；第二要求是在花费相同情况下找出happy值最高的路，第三要求是在花费和happy值都相同的情况下找出平均happy值最高的路，即经过最少的站点。故需要在子结构中层层判断并更新相应的数值。题目还要求我们输出这条路的路径，故需要一个数组path保存当前节点是由哪一个节点过来的。对了，我们还需要建立从名称到数字的映射和...
1087. All Roads Lead to Rome 解析
sheepyWYY的博客
05-09 1972
条条大路通罗马。 Dijstra+DFS通杀。。。 #include #include #include #include #include #define MAX 200 using namespace std; int n, k; string st; map city2int; map int2city; struct Link { int len; int C
C语言如何快速求值
2301_81985098的博客
08-26 602
4、可得： m = (i + j) / 2， n = (i - j) / 2，i 和 j 要么都是偶数，要么都是奇数。3、设置： m + n = i，m - n = j，i * j =168，i 和 j 至少一个是偶数。一个整数，它加上100后是一个完全平方数，再加上168又是一个完全平方数，请问该数是多少？2、计算等式：m2 - n2 = (m + n)(m - n) = 168。1、则：x + 100 = n2, x + 100 + 168 = m2。6、由于 i * j = 168， j>=2，则。
c++命令模式
最新发布
qq_71286244的博客
08-30 380
c++命令模式详细介绍
C语言破墙镐对称飞迷宫
qq_69383179的博客
08-22 2619
这里有我用C语言编译的破墙镐对称飞迷宫和与之相关的一些东西
[C++规范] 访问类成员变量的方式：直接访问还是通过成员函数访问？
Loewen丶的小窝
08-26 5332
在面向对象编程（OOP）中，通过成员函数（如`ME_HardwareTypeEnum Type() const;` 和 `int Id() const;`）来访问类的私有或受保护成员（如`m_hardwareType` 和 `m_id`），而不是直接通过公共成员访问，是一种更好的做法。
Third task is to draw a class diagram based on the following problem: There is a country that has cities and lot of roads between them. Cities and roads can be filled with traveling units (there are at least horse carriages, knight convoys and donkeys). When a traveling unit is in the road there is a change that bandit comes and captures it. The bandit can tow traveling units to a farm and hide them there. Every traveling unit has a driver that has nationality and name. Traveling units have also number of wheels/legs and weapons. Some of them can fire and some cannot. All the traveling units can move, but their max speed varies.
07-14
Sure, based on the given problem, here is a class diagram that represents the entities and their relationships: ``` +-----------------+ +-----------------+ | Country |<>----------| City | +-----------------+ +-----------------+ | | | | | - name | | - name | | - cities | | - roads | | | | | | + addCity() | | + addRoad() | | + removeCity() | | + removeRoad() | +-----------------+ +-----------------+ ^ | | | | | +----------------------+ | TravelingUnit | +----------------------+ | | | - type | | - driver | | - wheels/legs | | - weapons | | - canFire | | - maxSpeed | | | | + move() | | + captureByBandit() | +----------------------+ ^ | | | | | +---------------------+ | Driver | +---------------------+ | | | - nationality | | - name | | | +---------------------+ ``` Explanation: - The `Country` class represents a country and has a relationship with multiple `City` objects through the `cities` attribute. It also has attributes like `name` and methods like `addCity()` and `removeCity()` for managing cities. - The `City` class represents a city and has a relationship with multiple `Road` objects through the `roads` attribute. It has attributes like `name` and methods like `addRoad()` and `removeRoad()` for managing roads. - The `TravelingUnit` class represents a traveling unit and contains attributes like `type`, `driver`, `wheels/legs`, `weapons`, `canFire`, and `maxSpeed`. It has methods like `move()` for moving the unit and `captureByBandit()` for capturing the unit. - The `Driver` class represents a driver and contains attributes like `nationality` and `name`. It is associated with the `TravelingUnit` class. Note: This is a basic representation of the system based on the given problem statement. There might be additional classes or relationships required depending on the specific requirements of the system.
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值