POJ 1724 ROADS
来源:互联网 发布:Windows安装Python 编辑:程序博客网 时间:2024/06/01 10:24
ROADS
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.
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.
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.
5671 2 2 32 4 3 33 4 2 41 3 4 14 6 2 13 5 2 05 4 3 2
11
#include<stdio.h>#include<string.h>#include<queue>using namespace std;int book[110];int n,m,V,sum,flag,min1;struct note{ int city1; int city2; int len; int cose;} que[10100];int head[101];void dfs(int city,int len,int cose){ if(len>=min1||cose>V) return ; if(city==n) { if(len<min1) min1=len; flag=1; return ; } for(int i=head[city]; i; i=que[i].city2) { if(book[que[i].city1]) continue; book[que[i].city1]=1; dfs(que[i].city1,len+que[i].len,cose+que[i].cose); book[que[i].city1]=0; }}int main(){ scanf("%d %d %d",&V,&n,&m); memset(book,0,sizeof(book)); memset(head,0,sizeof(head)); flag=0; min1=9999999; int a; for(int i=1; i<=m; i++) { scanf("%d %d %d %d",&a,&que[i].city1,&que[i].len,&que[i].cose); que[i].city2=head[a]; head[a]=i; } book[1]=1; dfs(1,0,0); if(!flag) printf("-1"); else printf("%d\n",min1); return 0;}
阅读全文
0 0
- POJ 1724 ROADS
- POJ 1724 ROADS
- poj 1724 ROADS
- Poj 1724 ROADS
- POJ-1724-ROADS
- poj 1724 ROADS
- POJ 1724 ROADS
- POJ-1724-ROADS
- POJ 1724 ROADS (bfs)
- poj 1724 ROADS
- POJ 1724 ROADS
- POJ 1724 ROADS
- POJ 1724 ROADS
- POJ 1724 ROADS
- POJ 1724--ROADS
- poj 1724 ROADS
- poj 1724 ROADS
- POJ-1724 ROADS
- C++命名规则
- mysql 存储过程
- 筑讯材料·土|地漏小百科
- 通用接口测试用例设计
- struts2耦合和非耦合设置值和获取的方式
- POJ 1724 ROADS
- PythonWeb开发Django框架学习(十二)基础总结
- strong与weak
- 按下电源键到启动Home应用过程详解(三)
- 【比特币】搭建虚拟币开发核心运行环境
- poj 3278
- 2017.7.10 noi2008 假面舞会
- 运行caffe版(python)faster RCNN
- POJ 1276Cash Machine(多重背包 + 二进制优化)