POJ2431 Expedition
2015-08-22 20:11
330 查看
Expedition
Description
A group of cows grabbed a truck and ventured on an expedition deep into the jungle. Being rather poor drivers, the cows unfortunately managed to run over a rock and puncture the truck's fuel tank. The truck now leaks one unit of fuel every unit of distance
it travels.
To repair the truck, the cows need to drive to the nearest town (no more than 1,000,000 units distant) down a long, winding road. On this road, between the town and the current location of the truck, there are N (1 <= N <= 10,000) fuel stops where the cows
can stop to acquire additional fuel (1..100 units at each stop).
The jungle is a dangerous place for humans and is especially dangerous for cows. Therefore, the cows want to make the minimum possible number of stops for fuel on the way to the town. Fortunately, the capacity of the fuel tank on their truck is so large that
there is effectively no limit to the amount of fuel it can hold. The truck is currently L units away from the town and has P units of fuel (1 <= P <= 1,000,000).
Determine the minimum number of stops needed to reach the town, or if the cows cannot reach the town at all.
Input
* Line 1: A single integer, N
* Lines 2..N+1: Each line contains two space-separated integers describing a fuel stop: The first integer is the distance from the town to the stop; the second is the amount of fuel available at that stop.
* Line N+2: Two space-separated integers, L and P
Output
* Line 1: A single integer giving the minimum number of fuel stops necessary to reach the town. If it is not possible to reach the town, output -1.
Sample Input
Sample Output
Hint
INPUT DETAILS:
The truck is 25 units away from the town; the truck has 10 units of fuel. Along the road, there are 4 fuel stops at distances 4, 5, 11, and 15 from the town (so these are initially at distances 21, 20, 14, and 10 from the truck). These fuel stops can supply
up to 4, 2, 5, and 10 units of fuel, respectively.
OUTPUT DETAILS:
Drive 10 units, stop to acquire 10 more units of fuel, drive 4 more units, stop to acquire 5 more units of fuel, then drive to the town.
Source
USACO 2005 U S Open Gold
无语的WA:
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 7349 | Accepted: 2179 |
A group of cows grabbed a truck and ventured on an expedition deep into the jungle. Being rather poor drivers, the cows unfortunately managed to run over a rock and puncture the truck's fuel tank. The truck now leaks one unit of fuel every unit of distance
it travels.
To repair the truck, the cows need to drive to the nearest town (no more than 1,000,000 units distant) down a long, winding road. On this road, between the town and the current location of the truck, there are N (1 <= N <= 10,000) fuel stops where the cows
can stop to acquire additional fuel (1..100 units at each stop).
The jungle is a dangerous place for humans and is especially dangerous for cows. Therefore, the cows want to make the minimum possible number of stops for fuel on the way to the town. Fortunately, the capacity of the fuel tank on their truck is so large that
there is effectively no limit to the amount of fuel it can hold. The truck is currently L units away from the town and has P units of fuel (1 <= P <= 1,000,000).
Determine the minimum number of stops needed to reach the town, or if the cows cannot reach the town at all.
Input
* Line 1: A single integer, N
* Lines 2..N+1: Each line contains two space-separated integers describing a fuel stop: The first integer is the distance from the town to the stop; the second is the amount of fuel available at that stop.
* Line N+2: Two space-separated integers, L and P
Output
* Line 1: A single integer giving the minimum number of fuel stops necessary to reach the town. If it is not possible to reach the town, output -1.
Sample Input
4 4 4 5 2 11 5 15 10 25 10
Sample Output
2
Hint
INPUT DETAILS:
The truck is 25 units away from the town; the truck has 10 units of fuel. Along the road, there are 4 fuel stops at distances 4, 5, 11, and 15 from the town (so these are initially at distances 21, 20, 14, and 10 from the truck). These fuel stops can supply
up to 4, 2, 5, and 10 units of fuel, respectively.
OUTPUT DETAILS:
Drive 10 units, stop to acquire 10 more units of fuel, drive 4 more units, stop to acquire 5 more units of fuel, then drive to the town.
Source
USACO 2005 U S Open Gold
#include <stdio.h> #include <string.h> #include <algorithm> #include <queue> #define maxn 10010 struct Node { int pos, val; } A[maxn]; bool cmp(Node a, Node b) { return a.pos > b.pos; } int main() { // freopen("stdin.txt", "r", stdin); int N, L, P, i, cnt; while(scanf("%d", &N) == 1) { for(i = 0; i < N; ++i) scanf("%d%d", &A[i].pos, &A[i].val); scanf("%d%d", &L, &P); std::sort(A, A + N, cmp); std::priority_queue<int> pq; cnt = i = 0; while(i < N && P >= L - A[i].pos) pq.push(A[i++].val); while(P < L && !pq.empty()) { ++cnt; P += pq.top(); pq.pop(); while(i < N && P >= L - A[i].pos) pq.push(A[i++].val); } if(P < L) cnt = -1; printf("%d\n", cnt); } return 0; }
无语的WA:
#include <stdio.h> #include <string.h> #include <algorithm> #include <queue> #define maxn 10010 struct Node { int pos, val; } A[maxn]; bool cmp(Node a, Node b) { return a.pos > b.pos; } int main() { // freopen("stdin.txt", "r", stdin); int N, L, P, i, cnt; while(scanf("%d", &N) == 1) { for(i = 0; i < N; ++i) scanf("%d%d", &A[i].pos, &A[i].val); scanf("%d%d", &L, &P); std::sort(A, A + N, cmp); std::priority_queue<int> pq; cnt = 0; for(i = 0; P < L && i < N; ++i) { if(L - A[i].pos <= P) { pq.push(A[i].val); } else if(!pq.empty()) { P += pq.top(); pq.pop(); ++cnt; --i; } else break; } // int k = 0; // while(k < N && L - A[k].pos <= P) // pq.push(A[k++].val); // while(P < L && !pq.empty()){ // ++cnt; // P += pq.top(); pq.pop(); // while(k < N && L - A[k].pos <= P) // pq.push(A[k++].val); // } if(P < L) cnt = -1; printf("%d\n", cnt); } return 0; }
在桃姐的帮助下终于把上面那个wa代码改过来了,多谢桃姐。错误原因是仅仅顾着往队列里塞加油站,当全部油站都入队后汽车仍不能到达时忘了出队了...
#include <stdio.h> #include <string.h> #include <algorithm> #include <queue> #define maxn 10010 struct Node { int pos, val; } A[maxn]; bool cmp(Node a, Node b) { return a.pos > b.pos; } int main() { // freopen("stdin.txt", "r", stdin); int N, L, P, i, cnt; while(scanf("%d", &N) == 1) { for(i = 0; i < N; ++i) scanf("%d%d", &A[i].pos, &A[i].val); scanf("%d%d", &L, &P); std::sort(A, A + N, cmp); std::priority_queue<int> pq; cnt = 0; for(i = 0; P < L && i < N; ++i) { if(L - A[i].pos <= P) { pq.push(A[i].val); } else if(!pq.empty()) { P += pq.top(); pq.pop(); ++cnt; --i; } else break; } while(P < L && !pq.empty()) { P += pq.top(); pq.pop(); ++cnt; } if(P < L) cnt = -1; printf("%d\n", cnt); } return 0; }
相关文章推荐
- mysql 纸 mysql_fetch_array OR mysql_fetch_assoc OR mysql_fetch_row
- Mysql和SqlServer互相转换
- hdu1014 Uniform Generator
- Socket编程步骤
- UILabel
- BC-52-1001
- poj 2485 最小生成树中的最大边 prim
- c的rand()函数,相同的种子,windows和android下产生的随机数列不一样
- hdu 1027 Ignatius and the Princess II(产生第m大的排列,next_permutation函数)
- Python爬虫学习记录(1)——百度贴吧图片下载
- 九度oj 1129
- Eclipse搭建Android开发环境-Android SDK和ADT离线安装
- android-使用webview来开发混合应用
- zabbix 安装
- 在eclipse中JAVA从打包成jar程序到双击运行的整个过程(没有主清单属性问题的解决)
- 解析json数据
- 折半查找
- C++类的使用
- Linux命令详解(1):ls
- poj 1789 最小生成树 prim kruskal