Patrick and Shopping(模拟)
来源:互联网 发布:软件框架图 编辑:程序博客网 时间:2024/05/18 01:47
Today Patrick waits for a visit from his friend Spongebob. To prepare for the visit, Patrick needs to buy some goodies in two stores located near his house. There is ad1 meter long road between his house and the first shop and ad2 meter long road between his house and the second shop. Also, there is a road of lengthd3 directly connecting these two shops to each other. Help Patrick calculate the minimum distance that he needs to walk in order to go to both shops and return to his house.
Patrick always starts at his house. He should visit both shops moving only along the three existing roads and return back to his house. He doesn't mind visiting the same shop or passing the same road multiple times. The only goal is to minimize the total distance traveled.
The first line of the input contains three integers d1,d2, d3 (1 ≤ d1, d2, d3 ≤ 108) — the lengths of the paths.
- d1 is the length of the path connecting Patrick's house and the first shop;
- d2 is the length of the path connecting Patrick's house and the second shop;
- d3 is the length of the path connecting both shops.
Print the minimum distance that Patrick will have to walk in order to visit both shops and return to his house.
10 20 30
60
1 1 5
4
The first sample is shown on the picture in the problem statement. One of the optimal routes is: house first shop second shop house.
In the second sample one of the optimal routes is: house first shop house second shop house.
AC代码:
#include<iostream>#include<algorithm>#include<cstring>#include<string>#include<vector>#include<cstdio>#include<cmath>using namespace std;#define CRL(a) memset(a,0,sizeof(a))typedef __int64 ll;#define T 200005#define mod 1000000007int main(){#ifdef zsc freopen("input.txt","r",stdin);#endifint s1,s2,s3;while(~scanf("%d%d%d",&s1,&s2,&s3)){int t1=2*(s1+s2),t2=(s1+s2+s3);t1 = min(t1,t2);int t3=2*(s2+s3),t4=2*(s1+s3);t3=min(t3,t4);printf("%d\n",min(t1,t3));}return 0;}
- Patrick and Shopping(模拟)
- Patrick and Shopping(距离比较)
- A. Patrick and Shopping
- Patrick and Shopping(水题)
- Patrick and Shopping
- 【coderorces】Patrick and Shopping
- Patrick and Shopping
- Patrick and Shopping
- Patrick and Shopping
- C - Patrick and Shopping
- Patrick and Shopping
- 【codeforces】Patrick and Shopping
- Patrick and Shopping
- Patrick and Shopping
- 599A Patrick and Shopping
- 【CodeForces】599A - Patrick and Shopping(枚举)
- 【Codeforces】-599A-Patrick and Shopping(水)
- Codeforces Round #332 (Div. 2) 599A Patrick and Shopping(模拟)
- 移植uboot过程中 nand flash 驱动相关的一些资料分享
- 1-LTE Basic Procedure:Initialization Sequence : From Power-On to PRACH
- 最小生成树——Kruskal(克鲁斯卡尔)算法
- LeetCode Unique Paths II
- 【诚邀您免费报名】第十二届中国软件工程大会CCSE 2015
- Patrick and Shopping(模拟)
- 常用算法二(动态规划)
- DateTimePicker控件只显示年份
- MySQL-----MySQL中max函数查询最大值问题
- c++对象模型
- (5.1)uboot详解——时钟分频
- 前端多文件上传
- 地图定位
- -objc, ARC MRC混编,Undefined symbols for architecture x86_64 整理