zoukankan      html  css  js  c++  java
  • codeforces #332 div 2 A. Patrick and Shopping

     1 #include <cstdio>
     2 #include <iostream>
     3 #include <cmath>
     4 using namespace std;
     5 long long d1,d2,d3;
     6 int main()
     7 {
     8     cin>>d1>>d2>>d3;
     9     long long ans = 999999999999;
    10     ans = min(ans,d1+d2+d3);
    11     ans = min (ans,d1*2+d2*2);
    12     ans = min (ans,d1*2+2*d3);
    13     ans = min(ans,d2*2+2*d3);
    14     cout<<ans<<endl;
    15     return 0;
    16 }
    View Code
    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 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.

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

    水题。

  • 相关阅读:
    nginx通过多级代理获得真实用户IP的方法
    装饰器
    base64文件隐写脚本
    椭圆曲线加密
    mysql创建账号及管理权限
    Linux 中指定启动 tomcat 的 jdk 版本
    Linux 下创建 sftp 用户并限定目录
    linux 服务器脚本采集数据中文无法执行错误
    poi 读取使用 Strict Open XML 保存的 excel 文档
    win7 配置Windows Update 失败,还原更改,无法进入系统
  • 原文地址:https://www.cnblogs.com/111qqz/p/4982855.html
Copyright © 2011-2022 走看看