hdu 1896 Stone
来源:互联网 发布:软件立项申请表 编辑:程序博客网 时间:2024/06/05 13:03
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<string>#include<cstring>#include<algorithm>#include<cmath>#include<queue>using namespace std;struct Stone{ int pi; int di;};//定义优先次序struct cmp{ bool operator ()(Stone &a,Stone &b) { if(a.pi!=b.pi) return a.pi>b.pi; else return a.di>b.di; }};priority_queue<Stone,vector<Stone>,cmp> pq;int main(){ int T; cin>>T; while(T--) { int N; cin>>N; Stone stone; for(int i=0;i<N;++i) { cin>>stone.pi>>stone.di; pq.push(stone); } Stone ans; int num=0; //模拟过程 while(!pq.empty()) { ++num; ans=pq.top(); pq.pop(); if(num%2==1) { ans.pi+=ans.di; pq.push(ans); } } cout<<ans.pi<<endl; } return 0;}
0 0
- HDU 1896 stone
- hdu 1896 Stone
- HDU 4038 Stone
- hdu 1729 Stone Game
- Hdu 1729 Stone Game
- hdu 4387 Stone Game
- HDU 4764 Stone
- HDU 4764 Stone
- HDU 4764-Stone(博弈)
- HDU-Lifting the Stone
- HDU 4764 Stone
- hdu 4764 Stone
- HDU 4764 Stone
- HDU 4764 Stone(博弈)
- hdu 4387 Stone Game
- HDU 1729 Stone Game
- hdu 4764 Stone
- HDU 1729 Stone Game
- 【React Native开发】React Native控件之Switch开关与Picker选择器组件讲解以及使用(16)
- CF 4A Watermelon
- B/S总结--前台攻略--JS
- 猜数字游戏的提示(Master-Mind Hints, UVa 340)
- 现世因果教育受益者分享(摘自132集)
- hdu 1896 Stone
- Lua获取object在全图中的位置
- Uva Children's Game
- 【算法-字符串】【周期串】
- 【机器学习】Tensorflow基本使用
- SpringMvc实现原理
- JAVA—基础语法(一)
- 如何选择开源许可协议
- 净空法师:学传统文化喊口号不行,要从娃娃抓起