HDU1896 Stones【模拟+优先队列】
来源:互联网 发布:golang python 编辑:程序博客网 时间:2024/06/06 03:44
Stones
Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 3015 Accepted Submission(s): 1951
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.
InputThere 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.
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.
OutputFor 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.
Just output one line for one test case, as described in the Description.
Sample Input221 52 421 56 6
1112
Sempr|CrazyBird|hust07p43
SourceHDU 2008-4 Programming Contest
问题链接:HDU1896 Stones
问题简述:
Sempr走在路上时会玩一种游戏,遇见奇数块石头时将其扔到更远,遇到偶数块石头时则离开。问Sempr不会再遇到石头时,总共走了多少距离。
问题分析:
Sempr走在路上时,必然先遇到距离近的石头,所以需要用优先队列来表示问题。剩下的就是模拟走路的过程。
程序说明:(略)
题记:(略)
参考链接:(略)
AC的C++语言程序如下:
/* HDU1896 Stones */#include <iostream>#include <queue>#include <stdio.h>using namespace std;struct _node { int pos; int dist; friend bool operator <(const _node &a,const _node &b) { if(a.pos == b.pos) return a.dist > b.dist; else return a.pos > b.pos; }};int main(){ int t, n; scanf("%d", &t); while(t--) { priority_queue <_node> q; _node t; scanf("%d", &n); for(int i=1; i<=n; i++) { scanf("%d%d", &t.pos, &t.dist); q.push(t); } bool odd = true; while(!q.empty()) { t = q.top(); q.pop(); if(odd) { // 奇数时操作 t.pos += t.dist; q.push(t); } odd = !odd; } printf("%d\n", t.pos); } return 0;}
阅读全文
0 0
- HDU1896 Stones【模拟+优先队列】
- Hdu1896 Stones(优先队列)
- Stones(hdu1896)优先队列
- hdu1896 Stones 优先队列使用
- hdu1896 Stones(优先队列水)
- HDU1896 优先队列2
- hdu1896(优先队列)
- hdu1896(模拟+优先级队列)
- HDU1896- Stones
- HDU1896-Stones
- hdu1896 Stones
- hdu1896之优先队列应用
- Stones(优先队列)
- Stones(优先队列)
- HDU.1896 Stones【优先队列】【模拟】【8月13】
- HDU1896(优先队列的应用)
- HDU 1896 Stones(优先队列)
- 1896 Stones(优先队列)
- bzoj3236 作业 莫队+树状数组
- java 反射机制
- 链表翻转【比如链表1→2→3→4→5→6,k=2, 翻转后2→1→4→3→6→】
- ssm+bootstrap验证练习01注册验证(方法二)--代码实现
- 【学习笔记】天嵌2440第三季下学期——linux多线程同步
- HDU1896 Stones【模拟+优先队列】
- python语法基础入门
- 09 在ZStack里的定时器应用
- 17 多校
- NOI2017游记
- CreateThread,_beginthread与AfxbeginThread之间的区别
- MyBatis一对一关联查询总结(四)
- 安卓·动态权限申请
- allure用例定制参数及报告效果展示