(HDU - 1896)Stones

(HDU - 1896)Stones

Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)

Total Submission(s): 3093 Accepted Submission(s): 2015

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

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

题目大意：一条直线上有n个石头，一个人从左往右走，碰到奇数块石头（碰到一块石头数一个数，这里指数的数是奇数），就往右扔，碰到偶数的石头就不管他，如果两块石头在同一个位置，就扔大的那块（能扔的距离小的）。问最后最远的那块石头的位置。

思路：用优先队列模拟，每遇到奇数石头，就将其坐标加上D[i]，放回优先队列，当石头重叠时，先扔投大的（能扔的距离小的），故在比较函数中，以位置为第一关键字，以投掷距离为第二关键字。

#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;

const int maxn=100005;

struct node
{
    int pos,dis;//pos石头当前位置，dis石头能扔的距离 
};

bool operator<(node a,node b)
{
    return ((a.pos>b.pos)||(a.pos==b.pos&&a.dis>b.dis)); 
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int n;
        scanf("%d",&n);
        priority_queue<node> q;
        node tmp;
        for(int i=0;i<n;i++)
        {
            scanf("%d%d",&tmp.pos,&tmp.dis);
            q.push(tmp);
        }
        int cnt=1;
        while(!q.empty())
        {
            tmp=q.top();
            q.pop();
            if(cnt&1)//奇数
            {
                tmp.pos+=tmp.dis;
                q.push(tmp);
            }
            cnt++; 
        }
        printf("%d\n",tmp.pos);
    }
    return 0;
}