Codeforces 599A Patrick and Shopping 【水题】

原创 2015年11月23日 22:04:47

A. Patrick and Shopping
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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 a d1 meter long road between his house and the first shop and a d2 meter long road between his house and the second shop. Also, there is a road of length d3 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.

Input

The first line of the input contains three integers d1d2d3 (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.
Output

Print the minimum distance that Patrick will have to walk in order to visit both shops and return to his house.

Sample test(s)
input
10 20 30
output
60
input
1 1 5
output
4
Note

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 <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#define LL long long
using namespace std;
int main()
{
    LL d1, d2, d3;
    scanf("%lld%lld%lld", &d1, &d2, &d3);
    printf("%lld\n", min(d1+d3+min(d2, d3+d1), min(d1+d1+d2+d2, d2+d3+min(d3+d2, d1))));
    return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

【CodeForces】[599A]Patrick and Shopping

与【郑轻】[1799]wrz的压岁钱类似 需把情况考虑完整
  • u011493189
  • u011493189
  • 2016年07月21日 15:22
  • 94

【Codeforces 599A 】Patrick and Shopping

Patrick and ShoppingDescription Today Patrick waits for a visit from his friend Spongebob. To prepa...
  • WYK1823376647
  • WYK1823376647
  • 2016年07月24日 21:50
  • 136

CodeForces 599A Patrick and Shopping

A. Patrick and Shopping time limit per test 1 second memory limit per test 256 megabytes ...
  • geekdoe
  • geekdoe
  • 2016年03月29日 21:51
  • 144

【CodeForces】599A - Patrick and Shopping(枚举)

点击打开题目 A. Patrick and Shopping time limit per test 1 second memory limit per test ...
  • wyg1997
  • wyg1997
  • 2016年07月21日 20:15
  • 275

599A Patrick and Shopping

//599A Patrick and Shopping //最短距离,取4种情况直接比较 #include using namespace std; long long a, b, c, ans; i...
  • Joker_Zgh
  • Joker_Zgh
  • 2016年01月17日 16:52
  • 208

【Codeforces 599A】Patrick and Shopping 最短路程

C - Patrick and Shopping                     Today Patrick waits for a visit from his friend Spong...
  • lyg_air
  • lyg_air
  • 2017年01月17日 11:42
  • 133

Patrick and Shopping(水题)

I - Patrick and Shopping Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & ...
  • qq_30076791
  • qq_30076791
  • 2015年12月31日 16:38
  • 312

【codeforces】Patrick and Shopping

略水,情况考虑全就好#include __int64 min(__int64 a,__int64 b) { return a
  • better_space
  • better_space
  • 2016年07月21日 22:32
  • 89

CodeForces 599A Patrick and Shopping (商店购物最短路程)

A. Patrick and Shopping time limit per test 1 second memory limit per test 256 megabytes input...
  • shyazhut
  • shyazhut
  • 2016年07月22日 23:19
  • 306

Codeforces Round #332 (Div. 2) 599A Patrick and Shopping(模拟)

A. Patrick and Shopping time limit per test 1 second memory limit per test 256 megabytes...
  • GKHack
  • GKHack
  • 2015年11月23日 10:28
  • 622
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Codeforces 599A Patrick and Shopping 【水题】
举报原因:
原因补充:

(最多只允许输入30个字)