zoukankan      html  css  js  c++  java
  • Poj 3013基础最短路

    Description

    Christmas is coming to KCM city. Suby the loyal civilian in KCM city is preparing a big neat Christmas tree. The simple structure of the tree is shown in right picture.

    The tree can be represented as a collection of numbered nodes and some edges. The nodes are numbered 1 through n. The root is always numbered 1. Every node in the tree has its weight. The weights can be different from each other. Also the shape of every available edge between two nodes is different, so the unit price of each edge is different. Because of a technical difficulty, price of an edge will be (sum of weights of all descendant nodes) × (unit price of the edge).

    Suby wants to minimize the cost of whole tree among all possible choices. Also he wants to use all nodes because he wants a large tree. So he decided to ask you for helping solve this task by find the minimum cost.

    Input

    The input consists of T test cases. The number of test cases T is given in the first line of the input file. Each test case consists of several lines. Two numbers v, e (0 ≤ v, e ≤ 50000) are given in the first line of each test case. On the next line, v positive integers wi indicating the weights of v nodes are given in one line. On the following e lines, each line contain three positive integers a, b, c indicating the edge which is able to connect two nodes a and b, and unit price c.

    All numbers in input are less than 216.

    Output

    For each test case, output an integer indicating the minimum possible cost for the tree in one line. If there is no way to build a Christmas tree, print “No Answer” in one line.

    Sample Input

    2
    2 1
    1 1
    1 2 15
    7 7
    200 10 20 30 40 50 60
    1 2 1
    2 3 3
    2 4 2
    3 5 4
    3 7 2
    3 6 3
    1 5 9

    Sample Output

    15
    1210

    //INF开小会WA 开成0x3f3f3f3f 会WA
    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    #include<queue>
    using namespace std;
    const int N=50008;
    const int M=100008;
    int n,m,head[N],tot;
    const long long INF=1111111111111;
    unsigned long long val[N],d[N];
    bool vis[N];
    struct node{
        int next,v,w;
    }e[M];
    void add(int u,int v,int w){
        e[tot].v=v;
        e[tot].next=head[u];
        e[tot].w=w;
        head[u]=tot++;
    }
    void spfa(){
        for(int i=1;i<=n;++i) d[i]=INF,vis[i]=0;
        queue<int>Q;
        Q.push(1);
        d[1]=0,vis[1]=1;
        while(!Q.empty()){
            int u=Q.front();
            Q.pop();
            vis[u]=0;
            for(int i=head[u];i+1;i=e[i].next){
                int v=e[i].v;
                if(d[v]>d[u]+e[i].w){
                    d[v]=d[u]+e[i].w;
                    if(!vis[v]) {
                        Q.push(v);vis[v]=1;
                    }
                }
            }
        }
        for(int i=2;i<=n;++i) if(d[i]==INF) {puts("No Answer");return;}
        unsigned long long ans=0;
        for(int i=2;i<=n;++i)
            ans+=(long long)d[i]*val[i];
        printf("%llu
    ",ans);
    }
    int main(){
        int T,u,v,x;
        for(scanf("%d",&T);T--;){
            scanf("%d%d",&n,&m);
            for(int i=1;i<=n;++i) head[i]=-1;
            tot=0;
            for(int i=1;i<=n;++i) scanf("%llu",&val[i]);
            while(m--){
            scanf("%d%d%d",&u,&v,&x);
            add(u,v,x);
            add(v,u,x);
            }
            if(n==0||n==1) {puts("0");continue;}
            spfa();
        }
    }
  • 相关阅读:
    (6)STM32使用HAL库实现modbus的简单通讯
    (4)STM32使用HAL库实现串口通讯——理论讲解
    (3)STM32使用HAL库操作外部中断——实战操作
    (2)STM32使用HAL库操作外部中断——理论讲解
    对图片进行压缩、水印、伸缩变换、透明处理、格式转换操作1
    文件压缩、解压工具类。文件压缩格式为zip
    Bean与Map的转换 和 Map与Bean的转换
    正则 身份证的验证
    金钱处理工具类 人民币转换为大写
    正则表达式工具类,验证数据是否符合规范
  • 原文地址:https://www.cnblogs.com/mfys/p/7238081.html
Copyright © 2011-2022 走看看