首页 > 代码库 > poj 1724
poj 1724
ROADS
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 10844 | Accepted: 3994 |
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.
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 :
Notice that different roads may have the same source and destination cities.
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.
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
用vector超时了
AC代码:
#include<limits.h> #include<vector> #include<iostream> #include<algorithm> #include<stdio.h> using namespace std; struct Node{ int to,next; int len,pri; }Edge[10005]; int index; int head[105]; void add(int x,int y,int len,int pri){ Edge[++index].to=y; Edge[index].len=len; Edge[index].pri=pri; Edge[index].next=head[x]; head[x]=index; } int n,clen; int vis[105]; void dfs(int x,int len,int k){ if(x==n){ if(len<clen && k>=0){ clen=len; } return ; } if(len>clen) return ; for(int i=head[x];i;i=Edge[i].next){ int v=Edge[i].to; int pri=Edge[i].pri; int tlen=Edge[i].len; if(!vis[v] && k>=pri){ vis[v]=1; dfs(v,len+tlen,k-pri); vis[v]=0; } } return ; } int main(){ int m,k; while(scanf("%d%d%d",&k,&n,&m)!=EOF){ for(int i=1;i<=n;i++){ head[i]=vis[i]=0; } vis[1]=1; index=0; for(int i=1;i<=m;i++){ int x,y,len,pri; scanf("%d%d%d%d",&x,&y,&len,&pri); add(x,y,len,pri); } clen=INT_MAX; dfs(1,0,k); if(clen==INT_MAX) printf("-1\n"); else printf("%d\n",clen); } return 0; }
poj 1724
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。