HDU 1896 Stones(优先队列)
来源:互联网 发布:mac电脑兼容双系统吗 编辑:程序博客网 时间:2024/05/22 06:55
用优先队列模拟题意。1发A。
代码:
#include<stdio.h>#include<string.h>#include<queue>using namespace std;const int maxn=1e5+5;struct node{ int p,d; friend bool operator<(node a,node b) { if(a.p==b.p)return a.d>b.d; else return a.p>b.p; }}a[maxn];int main(){ int t; scanf("%d",&t); while(t--) { int n; scanf("%d",&n); priority_queue<node>Q; for(int i=1;i<=n;i++) { scanf("%d%d",&a[i].p,&a[i].d); Q.push(a[i]); } int ans; while(!Q.empty()) { node temp; temp=Q.top(); //printf("%d\n",Q.top().p); Q.pop(); temp.p=temp.p+temp.d; Q.push(temp); //printf("%d\n",Q.top().p); ans=Q.top().p; Q.pop(); } printf("%d\n",ans); }}
A - Stones
Time Limit:3000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uAppoint description:
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
0 0
- HDU 1896 Stones(优先队列)
- hdu 1896 Stones 优先队列
- hdu 1896 Stones(优先队列)
- HDU 1896 Stones (优先队列)
- HDU 1896 Stones 【优先队列】
- HDU 1896 Stones(优先队列)
- HDU 1896 Stones 优先队列
- HDU 1896 Stones 优先队列
- HDU 1896 Stones --优先队列+搜索
- HDU 1896 -- Stones (优先队列)
- hdu 杭电1896 Stones【优先队列】
- HDU 1896 Stones(优先队列)
- 【HDU]-1896-Stones(优先队列,好)
- HDU:1896 Stones(优先队列)
- HDU 1896 Stones (优先队列)
- hdu 1896 Stones(优先队列 Dijkstr)
- hdu--1896Stones(优先队列)
- HDU 1896:Stones(优先队列)
- MYSQL简单的封装
- Java NIO 简单了解
- android ListView利用SimpleAdapter显示特定布局并且异步加载网络图片
- 从零开发一款APP 三、Java Web后端登陆接口的设计
- Live Archive 3620 - Manhattan Wiring dp(插头)
- HDU 1896 Stones(优先队列)
- python学习——单元测试
- Android之EventBus
- linux 下文件的批量复制
- Rufus 2.11超级精简版/超精简/懂你版
- [Array] Pascal's Triangle
- [2016.7 test.5] T1
- spark 常用命令
- NYOJ小明的调查作业