poj 1724 ROADS

最新推荐文章于 2022-03-27 20:20:04 发布

原创最新推荐文章于 2022-03-27 20:20:04 发布 · 901 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#BFS #优先队列

poj 同时被 3 个专栏收录

184 篇文章

订阅专栏

最短路径

33 篇文章

订阅专栏

BFS

13 篇文章

订阅专栏

本文介绍了一个寻找有向图中从节点1到节点n的最短路径的问题，考虑到每条边的长度和费用限制，通过使用BFS结合优先队列的方法实现了有效求解。

ROADS

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9055		Accepted: 3347

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

Sample Output

题意：给出一个有向图，每条边有两个权值：长度和费用，给出k的金钱，问在总费用k的范围内，从结点1走到结点n的最短路径，若不存在，输出-1.

思路：BFS+优先队列。距离短的优先。

AC代码:

#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cmath>
#include <vector>
#include <cstdlib>
#include <iostream>
#define max2(a,b) ((a) > (b) ? (a) : (b))
#define min2(a,b) ((a) < (b) ? (a) : (b))

using namespace std;

struct node
{
    int v,len,cost;
    int next;
}edge[10005];
struct Node
{
    int u,dis,c;
    bool operator < (const Node &a) const
    {
        return dis>a.dis;
    }
};
int head[105];
int k,n,r,num;
void init()
{
    for(int i=1;i<=n;i++)
    head[i]=-1;
    num=0;
}
void add(int u,int v,int l,int c)
{
    edge[num].v=v;
    edge[num].len=l;
    edge[num].cost=c;
    edge[num].next=head[u];
    head[u]=num++;
}
priority_queue<Node> Q;
int dij(int s)
{
    Node a;
    a.u=1;
    a.dis=0;
    a.c=0;
    Q.push(a);
    while(!Q.empty())
    {
        Node cur=Q.top();
        Q.pop();
        if(cur.u==n) return cur.dis;
        for(int i=head[cur.u];i!=-1;i=edge[i].next)
        {
            if(cur.c+edge[i].cost<=k)
            {
                a.u=edge[i].v;
                a.dis=cur.dis+edge[i].len;
                a.c=cur.c+edge[i].cost;
                Q.push(a);
            }
        }
    }
    return -1;
}
int main()
{
    int u,v,l,c;
   scanf("%d%d%d",&k,&n,&r);
   init();
   while(r--)
   {
       scanf("%d%d%d%d",&u,&v,&l,&c);
       add(u,v,l,c);
   }
   printf("%d\n",dij(1));
   return 0;
}