CF-332-div2-A. Patrick and Shopping

原创 2015年11月21日 09:10:51

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 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.

Input

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.
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.


题意:某个家与2个相邻超市距离分别为d1和d2,2个超市距离为d3,求从家出发经2个超市后返回所需的最短路径长度,可以任意经过某个点多次,无限制。


思路:共2种走法:1:分别直接到2个超市(不经过d3),再原路返回;2:经过d3有2种情况:a:直接走成一个圈回到原地;b:经过到2个超市直接路径短的加上d3,再原路返回。
最后取最小值。


code:



版权声明:本文为博主原创文章,指明出处即可任意转载。

相关文章推荐

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...

【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)D】【数学 公式推导】Spongebob and Squares 正方形数量恰好为x个的所有大矩形

D. Spongebob and Squares time limit per test 2 seconds memory limit per test 256 megabyt...

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 Round 332 (Div 2)B】【扭转题意 位置映射】Spongebob and Joke 给b[]中的每个数找f[]中的位置

B. Spongebob and Joke time limit per test 2 seconds memory limit per test 256 megabytes ...

Codeforces Round #332 (Div. 2)_B. Spongebob and Joke

B. Spongebob and Joke time limit per test 2 seconds memory limit per test 256 megabytes ...

Codeforces Round #332 (Div. 2) D. Spongebob and Squares

Spongebob is already tired trying to reason his weird actions and calculations, so he simply asked y...

Codeforces Round #332 (Div. 2) D. Spongebob and Squares详解

Codeforces Round #332 (Div. 2) D. Spongebob and Squares
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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