zoukankan      html  css  js  c++  java
  • Codeforces 24A. Ring road

    A. Ring road
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Nowadays the one-way traffic is introduced all over the world in order to improve driving safety and reduce traffic jams. The government of Berland decided to keep up with new trends. Formerly all n cities of Berland were connected by n two-way roads in the ring, i. e. each city was connected directly to exactly two other cities, and from each city it was possible to get to any other city. Government of Berland introduced one-way traffic on all n roads, but it soon became clear that it's impossible to get from some of the cities to some others. Now for each road is known in which direction the traffic is directed at it, and the cost of redirecting the traffic. What is the smallest amount of money the government should spend on the redirecting of roads so that from every city you can get to any other?

    Input

    The first line contains integer n (3 ≤ n ≤ 100) — amount of cities (and roads) in Berland. Next n lines contain description of roads. Each road is described by three integers aibici (1 ≤ ai, bi ≤ n, ai ≠ bi, 1 ≤ ci ≤ 100) — road is directed from city ai to city bi, redirecting the traffic costs ci.

    Output

    Output single integer — the smallest amount of money the government should spend on the redirecting of roads so that from every city you can get to any other.

    Sample test(s)
    input
    3
    1 3 1
    1 2 1
    3 2 1
    
    output
    1
    
    input
    3
    1 3 1
    1 2 5
    3 2 1
    
    output
    2
    
    input
    6
    1 5 4
    5 3 8
    2 4 15
    1 6 16
    2 3 23
    4 6 42
    
    output
    39
    
    input
    4
    1 2 9
    2 3 8
    3 4 7
    4 1 5
    
    output
    0
    

    首先记录图中的环,枚举两种方向,输出花费最少的那一种。


    #include <iostream>
    #include <cstring>
    
    using namespace std;
    
    int a[111][111];
    int n,x,y,t,p,ans1,ans2;
    int loop[111];
    bool v[111];
    
    void dfs(int e)
    {
        v[e]=true;
        loop[p++]=e;
        for (int i=1;i<=n;i++)
        {
            if (!v[i]&&(a[e][i]>0||a[i][e]>0))
            {
                dfs(i);
            }
        }
    }
    
    int main()
    {
        memset(a,0,sizeof(a));
        memset(v,0,sizeof(v));
        cin>>n;
        for (int i=0;i<n;i++)
        {
            cin>>x>>y>>t;
            a[x][y]=t;
        }
        p=0;
        dfs(1);
        loop[p]=1;
        ans1=0;
        ans2=0;
        for (int i=0;i<p;i++) ans1+=a[ loop[i] ][ loop[i+1] ];
        for (int i=p;i>=1;i--) ans2+=a[ loop[i] ][ loop[i-1] ];
        cout<<min(ans1,ans2)<<endl;
        return 0;
    }



  • 相关阅读:
    NO.6: 若不想编译器提供自动生成的函数,就应该明确拒绝
    NO.5: 了解C++编译器默认为你生成的构造/赋值/析构
    NO.4: 确定对象被使用前已被初始化
    NO.3: 尽量使用const
    NO.2: 尽量以const,enum,inline 替换 #define
    NO.1: 视C++为一个语言联邦
    C/C++ exception类
    C/C++ 类成员函数指针 类成员数据指针
    c++中的 Stl 算法(很乱别看)
    自定义类签发校验token-实现多方式登录-自定义反爬类-admin后台表管理字段自定义-群查接口-搜索-排序-分页
  • 原文地址:https://www.cnblogs.com/cyendra/p/3038457.html
Copyright © 2011-2022 走看看