优先队列--poj2431

发布时间:2017-4-25 16:44:24 编辑:www.fx114.net 分享查询网我要评论
本篇文章主要介绍了"优先队列--poj2431",主要涉及到优先队列--poj2431方面的内容,对于优先队列--poj2431感兴趣的同学可以参考一下。

Language: Default Expedition Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4242   Accepted: 1370 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 4 4 4 5 2 11 5 15 10 25 10 Sample Output 2 需要注意的是,题目中的距离不是按顺序给出的。 #include<iostream> #include<queue> #include<cstdio> #include<algorithm> using namespace std; struct node { int A,B; }a[10005]; int N,L,P; void solve() { a[N].A=0; a[N].B=0; N++; priority_queue<int> q; int ans=0,tank=P,pos=0; for(int i=0;i<N;i++) { int d=L-a[i].A-pos; while(tank-d<0) { if(q.empty()) { puts("-1"); return; } tank+=q.top(); q.pop(); ans++; } tank-=d; pos=L-a[i].A; q.push(a[i].B); } cout<<ans<<endl; } bool cmp(node c,node d) { return c.A>d.A; } int main() { //freopen("in.txt","r",stdin); int x; cin>>N; for(int i=0;i<N;i++) { cin>>a[i].A; cin>>a[i].B; } cin>>L>>P; sort(a,a+N,cmp); solve(); return 0; }

上一篇:H面试程序(6):字符串中找出连续最长的数字串
下一篇:android 简析自定义布局、布局的执行流程

相关文章

相关评论

本站评论功能暂时取消,后续此功能例行通知。

一、不得利用本站危害国家安全、泄露国家秘密,不得侵犯国家社会集体的和公民的合法权益,不得利用本站制作、复制和传播不法有害信息!

二、互相尊重,对自己的言论和行为负责。

好贷网好贷款