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 Round 332 (Div 2)A】【水题】A. Patrick and Shopping 遍历三元环的最小成本

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

hpu暑假训练C - Patrick and Shopping 【思维】&&【水题】

Today Patrick waits for a visit from his friend Spongebob. To prepare for the visit, Patrick needs t...

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

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

Patrick and Shopping(模拟)

A. Patrick and Shopping Today Patrick waits for a visit from his friend Spongebob. To p...

Patrick and Shopping

Description Today Patrick waits for a visit from his friend Spongebob. To prepare for the visit, ...

codeforces 599B Spongebob and Joke

B. Spongebob and Joketime limit per test:2 secondsmemory limit per test:256 megabytesinput:standard ...
  • FTQOOO
  • FTQOOO
  • 2015年11月26日 21:31
  • 371

Codeforces 599 B Spongebob and Joke

传送门: http://codeforces.com/problemset/problem/599/B 题意: 给出序列f[i]和f[a[i]],要求还原序列a[i]不就是记录一下ans[f[i...
  • yp_2013
  • yp_2013
  • 2016年01月17日 11:19
  • 340

Codeforces 599 D Spongebob and Squares

传送门: http://codeforces.com/problemset/problem/599/D题意: 求出所有的n和m,使得在n*m的矩形里恰有k个不同的正方形和明显的数学公式题嘛!! ...
  • yp_2013
  • yp_2013
  • 2016年01月16日 23:58
  • 675

codeforces 599D. Spongebob and Squares【推公式+暴力枚举】

D. Spongebob and Squares time limit per test 2 seconds memory limit per test 256 megabyt...
  • Bcwan_
  • Bcwan_
  • 2016年08月30日 20:26
  • 281

CodeForces 599D Spongebob and Squares(DP+math)

Spongebob and Squares Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Codeforces 599A Patrick and Shopping 【水题】
举报原因:
原因补充:

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