HDU 1896 Stones 【优先队列】

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1896

思路：就是我们平常所说的扔石头游戏，按第一个例子来说，一个人向前走，遇到第一个石头（该石头位置为1），向前扔5米，然后遇到第二块石头，因为遇到的是偶数，所以跳过，接着这个人走到6米处时遇到原先扔的石头，但是这石头是第三个（仍为奇数），不必要纠结这个石头是原先的编号1，就把它当成编号3处理就行了。接着继续扔这第三个石头，继续向前扔5米，此时石头所在的位置为6+5=11米，这时遇到第四个石头（注意，偶数，不处理），此时结束，所以输出11【特别注意一下，当遇到两块石头时，扔大的（大的Di近）】。下一组数据也是类似的分析！代码如下：

//#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
struct node{
	int position,distance;
};
bool operator < (node a,node b){
	if(a.position==b.position)
	   return a.distance>b.distance;  //按照距离由小到大排序
	return a.position>b.position;  //按照位置由近到远排序 
} 
int main()
{
	int t;
	cin>>t;
	while(t--)
	{  
		int n;
		priority_queue<node>que;
		node Node;
		cin>>n;
		for(int i=0;i<n;i++)
		   {
		    cin>>Node.position>>Node.distance;
		    que.push(Node);
		   }
		bool flag=true;  //引入flag判断奇偶 
		while(!que.empty())
		{
			Node=que.top();
			que.pop();
			if(flag) //奇数的时候石头往前面扔，此时加入队列 
			{
				Node.position+=Node.distance;
				que.push(Node);  //加入队列（奇数） 
				flag=false; //下一个状态就是偶数了 
			}
			else
			  flag=true;
		}
		cout<<Node.position<<endl;
		que.pop();
	}
	return 0;
}

ps：断剑重铸之日，骑士归来之时！

Time Limit: 5000/3000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 4208    Accepted Submission(s): 2739

 

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.

 

 

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.

 

 

Output

Just output one line for one test case, as described in the Description.

 

 

Sample Input

2 2 1 5 2 4 2 1 5 6 6

 

 

Sample Output

11 12