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

最新推荐文章于 2022-11-22 23:15:14 发布

原创最新推荐文章于 2022-11-22 23:15:14 发布 · 943 阅读

0 ·

CC 4.0 BY-SA版权

Codeforces 同时被 2 个专栏收录

91 篇文章

订阅专栏

模拟

34 篇文章

订阅专栏

本文介绍了一道关于计算从家到两个商店再回家最短路径的问题。通过分析四种可能的行走路线，给出了一个简洁的算法实现，用于找到最小总行程距离。

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.

$\text{[math]}$

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 $\text{[math]}$ first shop $\text{[math]}$ second shop $\text{[math]}$ house.

In the second sample one of the optimal routes is: house $\text{[math]}$ first shop $\text{[math]}$ house $\text{[math]}$ second shop $\text{[math]}$ house.

题目链接:点击打开链接

给出家与两个商店的距离以及两个商店间的距离, 现在要从家去两个商店最后回到家, 问最短路径是多少.

模拟题, 可能有四种情况, 分别是: home - shop1 - shop2 - home, home - shop1 - home - shop2 - home,

home - shop1 - shop2 - shop1 - home, home - shop2 - shop1 - shop2 - home.

AC代码:

#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
#include "cmath"
#include "utility"
#include "map"
#include "set"
#include "vector"
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
ll a, b, c;
int main(int argc, char const *argv[])
{
    scanf("%lld%lld%lld", &a, &b, &c);
    printf("%lld\n", min(2 * (a + b), min(a + b + c, min(2 * (a + c), 2 * (b + c)))));
    return 0;
}