POJ 1724 ROADS (DFS)
来源:互联网 发布:资本在线网络贷款 编辑:程序博客网 时间:2024/05/20 02:24
ROADS
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15598 Accepted: 5622
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
5671 2 2 32 4 3 33 4 2 41 3 4 14 6 2 13 5 2 05 4 3 2
Sample Output
11
Source
CEOI 1998
#include<stdio.h> #include<string.h> const int N=1010; const int INF=1e6; struct Edge { int s,e,len,cost; int net; }edge[10*N]; int n,m,e_num,head[N],vis[N]; int ans; void AddEdge(int a,int b,int c,int d) { edge[e_num].s=a; edge[e_num].e=b; edge[e_num].len=c; edge[e_num].cost=d; edge[e_num].net=head[a]; head[a]=e_num++; } void dfs(int id,int dist,int money) { if(dist>ans) return; if(id==n&&money>=0&&dist<ans) ans=dist; for(int i=head[id];i!=-1;i=edge[i].net) { int u=edge[i].e; if(vis[u]==0&&money>=edge[i].cost) { vis[u]=1; dfs(u,dist+edge[i].len,money-edge[i].cost); vis[u]=0; } } } int main() { int i,a,b,c,d,k; while(~scanf("%d%d%d",&k,&n,&m)) { e_num=0; memset(head,-1,sizeof(head)); for(int i=0;i<m;i++) { scanf("%d%d%d%d",&a,&b,&c,&d); AddEdge(a,b,c,d); } ans=INF; memset(vis,0,sizeof(vis)); dfs(1,0,k); printf("%d\n",ans<INF?ans:-1); } }
阅读全文
0 0
- poj 1724 ROADS(dfs)
- POJ 1724 ROADS (DFS)
- poj-1724-ROADS(dfs)
- POJ 1724 ROADS(DFS剪枝)
- (POJ 1724)ROADS <DFS + 简单剪枝>
- ROADS poj 1724(dfs + 剪枝)
- POJ 1724 ROADS DFS+剪枝
- POJ 1724 ROADS 启发式DFS
- POJ 1724 ROADS【DFS+剪枝】
- poj 1724 ROADS(dfs)||(优先队列+dijkstra)
- [POJ 1724]ROADS[SPFA][DFS剪枝]
- POJ 1724 ROADS bfs || dfs || A*
- POJ 3411 Paid Roads(dfs)
- poj 3411 Paid Roads(dfs)
- POJ 3411 Paid Roads(DFS)
- poj 3411 Paid Roads(DFS)
- (POJ 3411)Paid Roads <DFS>
- POJ 3411 Paid Roads(dfs技巧)
- 【剑指offer】把数组排成最小的数
- 程序员的学习和积累
- 嵌入式学习10(C语言五大内存区间,变量的作用域和生存期,变量的存储类型)
- IDEA部分快捷键 git文件过滤以及其他杂文
- 压缩多张图片,解压后发现图片文件损坏的问题解决
- POJ 1724 ROADS (DFS)
- 0717学习总结(c++模板)
- 创建数据库的时候就将数据库保存到SDcard中
- 第2节-Linux的硬盘分区格式
- 连马云都要打包带走的美食_你不来一份儿?
- ORACLE RAC 集群的启动和关闭
- dubbo java.lang.NoClassDefFoundError
- 数对之差的最大值
- 互联网应用架构师