zoukankan      html  css  js  c++  java
  • A Walk Through the Forest[HDU1142]

    A Walk Through the Forest

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 4603    Accepted Submission(s): 1671

     

    Problem Description
    Jimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a hard day, he likes to walk home. To make things even nicer, his office is on one side of a forest, and his house is on the other. A nice walk through the forest, seeing the birds and chipmunks is quite enjoyable.
    The forest is beautiful, and Jimmy wants to take a different route everyday. He also wants to get home before dark, so he always takes a path to make progress towards his house. He considers taking a path from A to B to be progress if there exists a route from B to his home that is shorter than any possible route from A. Calculate how many different routes through the forest Jimmy might take.

     

     

     

    Input
    Input contains several test cases followed by a line containing 0. Jimmy has numbered each intersection or joining of paths starting with 1. His office is numbered 1, and his house is numbered 2. The first line of each test case gives the number of intersections N, 1 < N ≤ 1000, and the number of paths M. The following M lines each contain a pair of intersections a b and an integer distance 1 ≤ d ≤ 1000000 indicating a path of length d between intersection a and a different intersection b. Jimmy may walk a path any direction he chooses. There is at most one path between any pair of intersections.

     

     

     

    Output
    For each test case, output a single integer indicating the number of different routes through the forest. You may assume that this number does not exceed 2147483647

     

     

     

    Sample Input
    5 6
    1 3 2
    1 4 2
    3 4 3
    1 5 12
    4 2 34
    5 2 24
    7 8
    1 3 1
    1 4 1
    3 7 1
    7 4 1
    7 5 1
    6 7 1
    5 2 1
    6 2 1
    0
     

     

    Sample Output
    2
    4
     

     

    Source
    University of Waterloo Local Contest 2005.09.24
     

     

    Recommend
    Eddy

    f[i]表示从i到2有多少种方法,f[2]=1,f[x]=Σf[u]{d[x]>d[u]}

    #include<stdio.h>
    #include<string.h>
    #include<queue>
    using namespace std;
    int s[1010][1010],e[1010][1010];
    bool vis[1010];
    int d[1010],f[1010];
    int ans=0;
    void spfa()
    {
        int i;
        memset(vis,false,sizeof(vis));
        vis[2]=true;
        memset(d,0x3F,sizeof(d));
        d[2]=0;
        queue<int> q;
        while (!q.empty()) q.pop();
        q.push(2);
        while (!q.empty())
        {
            int x=q.front();
            q.pop();
            vis[x]=false;
            for (i=1;i<=s[x][0];i++)
            {
                int u=s[x][i];
                if (d[x]+e[x][i]<d[u])
                {
                    d[u]=d[x]+e[x][i];
                    if (!vis[u])
                    {
                        vis[u]=true;
                        q.push(u);
                    }
                }
            }
        }
    }
    void dfs(int x)
    {
        int i;
        for (i=1;i<=s[x][0];i++)
        {
            int u=s[x][i];
            if (d[u]<d[x])
            {
                if (f[u]>0) f[x]+=f[u];
                else 
                {
                    dfs(u);
                    f[x]+=f[u];
                }
            }
        }
    }
    int main()
    {
        int n,m,i,u,v,dd;
        while (scanf("%d",&n)!=EOF)
        {
            if (n==0) return 0;
            memset(s,0,sizeof(s));
            memset(e,0,sizeof(e));
            scanf("%d",&m);
            for (i=1;i<=m;i++)
            {
                scanf("%d%d%d",&u,&v,&dd);
                s[u][0]++;
                s[u][s[u][0]]=v;
                s[v][0]++;
                s[v][s[v][0]]=u;
                e[u][s[u][0]]=dd;
                e[v][s[v][0]]=dd;
            }
            spfa();
            memset(f,0,sizeof(f));
            f[2]=1;
            dfs(1);
            printf("%d
    ",f[1]);
        }
        return 0;
    }
    

     

     

  • 相关阅读:
    【转】技术人员,你拿什么来拯救你的生活一个牛人的故事
    正则表达式匹配Html标签
    WebClient读取网络数据
    [转]浮点数的存储格式
    [转].NET.GC 浅谈.net托管程序中的资源释放问题
    [转]c#利用WebClient和WebRequest获取网页源代码的比较
    bzoj1934
    1036: [ZJOI2008]树的统计Count (树链剖分模板)
    1834: [ZJOI2010]network 网络扩容 (最小费用最大流模板)
    1602: [Usaco2008 Oct]牧场行走(倍增模板)
  • 原文地址:https://www.cnblogs.com/dramstadt/p/3261500.html
Copyright © 2011-2022 走看看