POJ 3411 Paid Roads（DFS）

最新推荐文章于 2017-10-05 10:02:46 发布

一种坚持__

最新推荐文章于 2017-10-05 10:02:46 发布

阅读量351

点赞数

分类专栏： POJ

本文链接：https://blog.csdn.net/u014361775/article/details/44497253

版权

POJ 专栏收录该内容

102 篇文章 0 订阅

订阅专栏

Paid Roads

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 5708		Accepted: 2054

Description

A network of m roads connects N cities (numbered from 1 to N). There may be more than one road connecting one city with another. Some of the roads are paid. There are two ways to pay for travel on a paid road i from city a_i to city b_i:

in advance, in a city c_i (which may or may not be the same as a_i);
after the travel, in the city b_i.

The payment is P_i in the first case and R_i in the second case.

Write a program to find a minimal-cost route from the city 1 to the city N.

Input

The first line of the input contains the values of N and m. Each of the following m lines describes one road by specifying the values of a_i, b_i, c_i, P_i, R_i (1 ≤ i ≤ m). Adjacent values on the same line are separated by one or more spaces. All values are integers, 1 ≤ m, N ≤ 10, 0 ≤ P_i , R_i ≤ 100, P_i ≤ R_i (1 ≤ i ≤ m).

Output

The first and only line of the file must contain the minimal possible cost of a trip from the city 1 to the city N. If the trip is not possible for any reason, the line must contain the word ‘impossible’.

Sample Input

4 5
1 2 1 10 10
2 3 1 30 50
3 4 3 80 80
2 1 2 10 10
1 3 2 10 50

Sample Output

对于每行输入的a,b,c,p,r,意为如果a-b时，c之前没有到达过，则花费为r;若到达过，花费r，p均可，求1-n的最小花费

这道题一些边可以重复经历，因为使一些点已经遍历过后，在遍历其他点的时候可以选择花费更小的p，一些点的不能重复多次经历，这样会TLE，所以我们的标记数组要记下遍历的次数，>4跳出

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <stdlib.h>
    #include <algorithm>
    #define N 20
    #define inf 0x3f3f3f3f
    using namespace std;
    int b[N];
    int n,m,ans;
    struct node
    {
        int x,y,z;
        int p,r;
    }q[N];
    void dfs(int a,int sum)
    {
        if(a==n)
           {
               ans=min(ans,sum);
                return ;
           }
        for(int i=0;i<m;i++)
        {
            if(q[i].x==a && b[q[i].y]<=4)
            {
                if((!b[q[i].z]) ||(b[q[i].z] && q[i].r>q[i].r))
                {
                    b[q[i].y]++;
                    dfs(q[i].y,sum+q[i].r);
                    b[q[i].y]--;
                }
                else
                {
                     b[q[i].y]++;
                    dfs(q[i].y, sum+q[i].p);
                    b[q[i].y]--;
                }
            }
        }
    }
    int main()
    {
       while(~scanf("%d%d",&n,&m))
       {
          for(int i=0;i<m;i++)
           scanf("%d%d%d%d%d",&q[i].x,&q[i].y,&q[i].z,&q[i].p,&q[i].r);
          ans=inf;
          memset(b,0,sizeof(b));
          dfs(1,0);
           if(ans==inf)
            printf("impossible\n");
           else
           printf("%d\n",ans);
       }
        return 0;
    }