2017寒假集训-小题训练1:C - Patrick and Shopping
2017-01-16 19:06
405 查看
C - Patrick and Shopping
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 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.
Example
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代码:http://paste.ubuntu.com/23809844/
一次就AC,岂不美哉~
题解:这道题的大意,就是输入三个整数分别为家到商店A的距离,家到商店B的距离,两个商店之间的距离
我们的要求是最后所走的路程最小,可以走重复的路。
那么因为只有三个地点,我们完全可以写出全部的情况:
1:家->A->家->B->家
2:家->A->B->家
3:家->A->B->A->家
4:家->B->A->B->家
然后只要取四种情况中 所走的路最短的那种即可。
相关文章推荐
- 2017寒假集训-小题训练1:F - Ilya and tic-tac-toe game
- 2017寒假集训-小题训练1:E - Seating On Bus
- 2017寒假集训-小题训练1:B - Indivisibility
- 2017寒假集训-小题训练1:A - Magic Spheres
- 2017寒假集训-小题训练1:D - USB Flash Drives
- [寒假集训第一场]gym101606 2017 United Kingdom and Ireland Programming Contest (UKIEPC 2017)
- hpu暑假训练C - Patrick and Shopping 【思维】&&【水题】
- (2017多校训练第三场)HDU - 6063 RXD and math 找规律 + 快速幂
- 【codeforces】Patrick and Shopping
- C - Patrick and Shopping
- Patrick and Shopping
- Codeforces Round #332 (Div. 2) A. Patrick and Shopping
- 2017 多校训练第三场 HDU 6063 RXD and math
- HPUOJ---2017寒假训练--专题2/L-还是畅通工程
- 【Codeforces】-599A-Patrick and Shopping(水)
- Patrick and Shopping
- Codeforces Round #332 (Div. 2) A. Patrick and Shopping
- A. Patrick and Shopping
- C - Patrick and Shopping
- HPUOJ---2017寒假训练--专题3/A-Til the Cows Come Home(最短路-dijkstra)