hdu Problem-1896(优先队列+模拟)
来源:互联网 发布:js this指向 编辑:程序博客网 时间:2024/05/21 09:24
Stones
Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2739 Accepted Submission(s): 1763
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
//思路:用优先队列维护(pi小的优先级高,如果pi相等则di小的优先级高),然后模拟即可
AC源码:
#include <iostream>#include <cstdio>#include <vector>#include <queue>#include <algorithm>using namespace std;struct stone{int pi;int di;bool operator<(const stone& y)const{if(pi==y.pi)return di>y.di;elsereturn pi>y.pi;}};priority_queue<stone> pri;int main(){int T,n;cin>>T;while(T--){cin>>n;int a,b;while(n--){cin>>a>>b;pri.push((stone){a,b});}int i=1;stone ans;while(!pri.empty()){if(i%2){stone tmp=pri.top();pri.pop();pri.push((stone){tmp.di+tmp.pi,tmp.di});i+=1;}else{ans=pri.top();pri.pop();i+=1;}}printf("%d\n",ans.pi);}return 0;}
阅读全文
0 0
- hdu Problem-1896(优先队列+模拟)
- HDU 5437--优先队列模拟
- HDU-5437-模拟-优先队列
- HDU 6136 模拟 + 优先队列
- HDU 6136 优先队列 模拟
- hdu 6136 模拟+优先队列
- hdu 6168 模拟+优先队列
- hdu 5437 优先队列 模拟
- HDU.1896 Stones【优先队列】【模拟】【8月13】
- hdu Problem 1242 Rescue bfs + 优先队列
- hdu 1896 优先队列
- hdu 1896 优先队列
- HDU 1896 优先队列
- Hdu 1434 幸福列车【优先队列模拟】
- 模拟 优先队列(hdu 5437)
- HDU 6180 Schedule【优先队列+模拟】
- hdu 2364 Escape【模拟优先队列】【bfs】
- HDU 1896 Stones(优先队列)
- 三元表达式&列表解析&生成器表达式
- 简单的下拉导航条代码
- 【Python学习笔记】利用Python爬取百度搜索结果
- Windows Server 2012 +WDK7600.16385.1+VS2008驱动开发环境搭建
- linux服务器被当肉鸡过程
- hdu Problem-1896(优先队列+模拟)
- django 分页
- Java和前端的感受
- spring注解方式 idea报could not autowire,eclipse却没有问题
- SQLSERVER Agent服务无法启动
- Opencv学习之阈值化处理
- 【spark】spark2.1.1集群搭建
- Windows下使用Gradle创建Java项目
- SDUT-1175 C语言实验——分割整数