zoukankan      html  css  js  c++  java
  • HDU 1896 Stones

                      Stones



     

    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
     
     1 #include<cstdio>
     2 #include<queue>
     3 using namespace std;
     4 
     5 struct stone
     6 {
     7     int pos;
     8     int disc;
     9     bool operator < (const stone &temp)const
    10     {
    11         if(pos==temp.pos)
    12         return disc>temp.disc;
    13         return pos>temp.pos;
    14     }
    15 };
    16 
    17 int main()
    18 {
    19     int n,t;
    20     scanf("%d",&t);
    21     while(t--)
    22     {
    23         priority_queue<stone>q;
    24         scanf("%d",&n);
    25         bool flag=true;
    26         while(n--)
    27         {
    28             stone node;
    29             int temp1,temp2;
    30             scanf("%d%d",&temp1,&temp2);
    31             node.pos=temp1;
    32             node.disc=temp2;
    33             q.push(node);
    34         }
    35         int ans;
    36         while(!q.empty())
    37         {
    38             stone node=q.top();
    39             q.pop();
    40             if(flag)
    41             {
    42                 node.pos+=node.disc;
    43                 q.push(node);
    44             }
    45             ans=node.pos;
    46             flag=!flag;
    47         }
    48         printf("%d
    ",ans);
    49     }
    50     return 0;
    51 }    
     
     
  • 相关阅读:
    Vue基础进阶 之 过渡效果
    Vue基础进阶 之 自定义指令
    Vue基础进阶 之 实例方法--生命周期
    Vue基础进阶 之 实例方法
    Vue基础进阶 之 常用的实例属性
    Vue基础进阶 之 计算属性的使用
    Vue基础进阶 之 Vue生命周期与钩子函数
    JavaScript 条件判断算法综合实战
    (KMP)Simpsons’ Hidden Talents -- hdu -- 2594
    (并查集)Travel -- hdu -- 5441(2015 ACM/ICPC Asia Regional Changchun Online )
  • 原文地址:https://www.cnblogs.com/homura/p/4684096.html
Copyright © 2011-2022 走看看