Stones
Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 595 Accepted Submission(s): 342
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
2 2 1 5 2 4 2 1 5 6 6
Sample Output
11 12
Author
Sempr|CrazyBird|hust07p43
Source
Recommend
lcy
题意:从左往右的一条路中有n块石头,位置是p,开始走,遇到的石头如果是奇数个,就扔出去,如果是偶数个就不用管,求石头的最远距离。
思路:用优先队列解决,先将所有的石头放入队列中,如果是奇数个石头,就改变的它的位置p,然后重新加入队列。一直到最后一块石头。
#include<stdio.h>
#include<queue>
using namespace std;
struct node
{
int pos;
int dis;
bool operator<(const node t)const
{
if(pos!=t.pos)return t.pos<pos;
return t.dis<dis;
}
};
int main()
{
int t,n;
node now;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
priority_queue<node>q;
for(int i=0;i<n;i++)
{
scanf("%d%d",&now.pos,&now.dis);
q.push(now);
}
bool flag=true;
while(!q.empty())
{
now=q.top();
q.pop();
if(flag==true)
{
flag=false;
now.pos+=now.dis;
q.push(now);
}
else flag=true;
}
printf("%d\n",now.pos);
}
return 0;
}