优先队列例题
来源:互联网 发布:台达plc编程软件手册 编辑:程序博客网 时间:2024/05/24 07:10
Stones
Time Limit : 5000/3000ms (Java/Other) Memory Limit : 65535/32768K (Java/Other)
Total Submission(s) : 48 Accepted Submission(s) : 38
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
Problem Description
Because of the wrong status of the bicycle, Sempr begin to walk east to west every morning and walk back every evening. Walking may cause a little tired, so Sempr always play some games this time.
There are many stones on the road, when he meet a stone, he will throw it ahead as far as possible if it is the odd stone he meet, or leave it where it was if it is the even stone. Now give you some informations about the stones on the road, you are to tell me the distance from the start point to the farthest stone after Sempr walk by. Please pay attention that if two or more stones stay at the same position, you will meet the larger one(the one with the smallest Di, as described in the Input) first.
There are many stones on the road, when he meet a stone, he will throw it ahead as far as possible if it is the odd stone he meet, or leave it where it was if it is the even stone. Now give you some informations about the stones on the road, you are to tell me the distance from the start point to the farthest stone after Sempr walk by. Please pay attention that if two or more stones stay at the same position, you will meet the larger one(the one with the smallest Di, as described in the Input) first.
Input
In the first line, there is an Integer T(1<=T<=10), which means the test cases in the input file. Then followed by T test cases.
For each test case, I will give you an Integer N(0<N<=100,000) in the first line, which means the number of stones on the road. Then followed by N lines and there are two integers Pi(0<=Pi<=100,000) and Di(0<=Di<=1,000) in the line, which means the position of the i-th stone and how far Sempr can throw it.
For each test case, I will give you an Integer N(0<N<=100,000) in the first line, which means the number of stones on the road. Then followed by N lines and there are two integers Pi(0<=Pi<=100,000) and Di(0<=Di<=1,000) in the line, which means the position of the i-th stone and how far Sempr can throw it.
Output
Just output one line for one test case, as described in the Description.
Sample Input
221 52 421 56 6
Sample Output
1112
题意:就是奇数的石头要扔,偶数的石头不要动。
代码:
#include <iostream>#include <stdio.h>#include <string.>#include <queue>using namespace std;struct node{ int m,n; friend bool operator<(node a,node b) { if(a.m!=b.m) return a.m>b.m;//最小值优先 else return a.n>b.n; }};int main(){ int t; while(cin>>t) { while(t--) { int n; cin>>n; int i; priority_queue<node>q; node a,b; for(i=0;i<n;i++) { int c,d; cin>>c>>d; a.m=c; a.n=d; q.push(a); } int z=0;//判断石头是否是偶数个; int sum=0; while(!q.empty()) { z++; a=q.top(); sum=a.m; if(z%2==0) { q.pop(); } else { b.m=a.m+a.n; b.n=a.n; q.pop(); q.push(b); } } cout<<sum<<endl; } } return 0;}
0 0
- 优先队列例题
- 【经典优先队列例题整理】
- 算法竞赛入门经典例题-优先队列(阿格斯)
- 第三章 例题三 阿格斯(自定义优先队列)
- Uva136 Ugly Numbers 【优先队列】【例题5-7】
- Uva10603 Fill 【隐式图bfs(优先队列)】【例题7-8】
- Poj—2431 Expedition 优先队列使用经典例题
- 优先队列详解+ACM例题分析(转载)
- 例题5-7 UVA 136 Ugly Numbers丑数(set+优先队列)
- 指南 第三章 例题3 UVALive 3135 Argus(优先队列的应用)
- 堆(优先队列,最大堆的基本操作,堆的例题)
- 优先队列
- 优先队列
- 优先队列
- 优先队列
- 优先队列
- 优先队列
- 优先队列
- 搜索2(广度优先)Rescue
- Python爬虫之1 安装scrapy
- 媒体和相机:媒体录音
- code[vs] 1220数学三角形
- 浅谈JavaScript《三 DOM事件》
- 优先队列例题
- 【CC2640】CC2640架构及原理
- 【实训】Android Studio 上传项目到 GitHub
- Python的编码问题
- 事务传播属性
- 括号配对问题
- linux驱动开发之字符设备框架
- 量化趣谈——不务正业的数学家James Simons
- 机器学习算法之SVM(2)松弛变量