[POJ] 1724 ROADS

ROADS

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9971		Accepted: 3706

Description

N cities named with numbers 1 ... N are connected with one-way roads. Each road has two parameters associated with it : the road length and the toll that needs to be paid for the road (expressed in the number of coins). 
Bob and Alice used to live in the city 1. After noticing that Alice was cheating in the card game they liked to play, Bob broke up with her and decided to move away - to the city N. He wants to get there as quickly as possible, but he is short on cash. 

We want to help Bob to find the shortest path from the city 1 to the city N that he can afford with the amount of money he has. 

Input

The first line of the input contains the integer K, 0 <= K <= 10000, maximum number of coins that Bob can spend on his way. 
The second line contains the integer N, 2 <= N <= 100, the total number of cities. 

The third line contains the integer R, 1 <= R <= 10000, the total number of roads. 

Each of the following R lines describes one road by specifying integers S, D, L and T separated by single blank characters : 

• S is the source city, 1 <= S <= N 
• D is the destination city, 1 <= D <= N 
• L is the road length, 1 <= L <= 100 
• T is the toll (expressed in the number of coins), 0 <= T <=100

Notice that different roads may have the same source and destination cities.

Output

The first and the only line of the output should contain the total length of the shortest path from the city 1 to the city N whose total toll is less than or equal K coins. 
If such path does not exist, only number -1 should be written to the output. 

Sample Input

5
6
7
1 2 2 3
2 4 3 3
3 4 2 4
1 3 4 1
4 6 2 1
3 5 2 0
5 4 3 2

Sample Output

11

Source

CEOI 1998

 

 

题目地址：http://poj.org/problem?id=1724

 

题解：该图所有路都为单向路,每条路有两个限制元素，路长length和通行费toll，求总花费在不超过K的情况下从点1到点n的最短路。根据数据类型和规模选用spfa即可，松弛过程中再运用动态规划的思想，维护一个dist[vi][ki],代表在节点vi花费ki时走的最短路。预处理dist[i][j]=MAX_NUMBER,dist[1][0]=0;

 

代码：

#include<stdio.h>
#include<string.h>
#include<limits.h>
#include<stdbool.h>
int i,j,n,m,ki,r,x,y,z,p,tot,length,
    toit[110000],list[110],next[110000],cost[110000],
    q[500000],len[110000],dist[110][11000];

bool can[110];
int 
pre()
{
    memset(toit,0,sizeof(toit));
    memset(list,0,sizeof(list));
    memset(next,0,sizeof(next));
    memset(dist,3,sizeof(dist));
    memset(cost,0,sizeof(cost));
    memset(can,true,sizeof(can));
    memset(len,0,sizeof(len));
    tot=0;length=35111111;
    return 0;
}

int 
min(int a,int b)
{
    if(a<b) return(a);
    else return(b);
}

int 
add(int x,int y,int z,int p)
{
    tot++;
    toit[tot]=y;
    next[tot]=list[x];
    list[x]=tot;
    cost[tot]=p;
    len[tot]=z;
    
    return 0;
}

int 
spfa(int s)
{
    int i,j,head,tail,v,k;
    head=0;tail=1;
    q[1]=s; 
    can[s]=false;
    
    while(head!=tail)
    {
        head=head%500000+1;
        v=q[head];
        k=list[v];
        
        while(k!=0)
        {                   
            for(i=cost[k];i<=ki;i++)
            if(dist[v][i-cost[k]]+len[k]<dist[toit[k]][i])
            {
                dist[toit[k]][i]=dist[v][i-cost[k]]+len[k];
                if(can[toit[k]])
                {
                    tail=tail%500000+1;
                    q[tail]=toit[k];
                    can[toit[k]]=false;
                }
            }
            k=next[k];
        }
        can[v]=true;
    }
    return 0;
}

int 
init()
{
    scanf("%d
%d
%d
",&ki,&n,&r);
    for(i=1;i<=r;i++)
    {
        scanf("%d%d%d%d",&x,&y,&z,&p);
        add(x,y,z,p);
    }
    return 0;
}

int 
main()
{
    pre();
    init();
    dist[1][0]=0;
    spfa(1);
    
    for(i=0;i<=ki;i++)
    length=min(length,dist[n][i]);
    
    if(length==35111111) printf("-1
");else
    printf("%d
",length);
    return 0;
}