zoukankan      html  css  js  c++  java
  • 杭电1896--Stones

    Stones

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


    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
     

     

    Author
    Sempr|CrazyBird|hust07p43
     

     

    Source
     

     

    Recommend
    lcy   |   We have carefully selected several similar problems for you:  1892 1899 1895 1894 1897 
    题意难懂: Pi, Di  分别表示位置、 能被扔多远。输出最远位置。
    ac:
     1 #include <queue>
     2 #include <cstdio>
     3 #include <iostream>
     4 using namespace std;
     5 
     6 struct play
     7 {
     8     int posi, dy;
     9     friend bool operator < (play posi, play dy)
    10     {
    11         if(posi.posi == dy.posi)
    12             return posi.dy > dy.dy;        //小 → →  大; 
    13         else
    14             return posi.posi > dy.posi;    //小 → → 大; 
    15     }  
    16 } ;
    17 
    18 int main()
    19 {
    20     int t;
    21     scanf("%d", &t);
    22     while(t--)
    23     {
    24         priority_queue <play> q;
    25         int i, m;
    26         play t;
    27         scanf("%d", &m);
    28         for(i=0; i<m; i++)
    29         {
    30             scanf("%d %d", &t.posi, &t.dy);
    31             q.push(t);
    32         }
    33         int ans = 1;
    34         while(!q.empty())      
    35         {
    36             t = q.top();
    37             q.pop();                  //剔除偶数时**。 
    38             if(ans % 2 == 1)
    39             {
    40                 t.posi+=t.dy;         //更新位置,重新入队。 
    41                 q.push(t);    
    42             } 
    43             ++ans;
    44         }
    45         printf("%d
    ", t.posi);        
    46     }
    47     return 0;
    48 }
  • 相关阅读:
    选中实现jquery实现复选框checkbox全选(完善)
    对话框control在对话框picture control中利用opengl进行绘图
    nullnull数字对象的常用处理方法NSNumber
    androidclassListView的Item含有CheckBox时的处理
    绘图对话框基于MFC对话框的OpenGL三维图形开发
    组织学习【学习笔记】《卓有成效的管理者》 第三章 我能贡献什么
    集合元素并查集
    开源请求程序员的黄金时代
    客户端生成nginx webdav配置
    情况虚拟化实战虚拟化存储设计之三MultiPathing
  • 原文地址:https://www.cnblogs.com/soTired/p/4685455.html
Copyright © 2011-2022 走看看