zoukankan      html  css  js  c++  java
  • hdu 1896 优先队列

    http://acm.hdu.edu.cn/showproblem.php?pid=1896

    题目意思待理解!!!

    Stones

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


    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
     
    #include <stdio.h>
    #include <string.h>
    #include <queue>
    #include <vector>
    #include <iostream>
    using namespace std;
    struct stone
    {
        int point,dist;
    };
    struct cmp
    {
        bool operator()(stone a,stone b)
        {
            if(a.point==b.point)return a.dist>b.dist;
            else return a.point>b.point;
        }
    };
    
    priority_queue<stone,vector<stone>,cmp> q;
    
    int main()
    {
        int n,m,i,j;
        scanf("%d",&n);
        stone st;
    
        while(n--)
        {   int k=1,t=0;
            int resu;
            scanf("%d",&m);
            while(!q.empty())q.pop();
            for(i=0;i<m;i++)
            {
                scanf("%d%d",&st.point,&st.dist);
                q.push(st);
            }
            while(!q.empty())
            {
                st=q.top();
                q.pop();
    
                if(k%2==1)
                {
                        st.point+=st.dist;
                        q.push(st);
                        //resu=st.point;
                }
                //else q.pop();
                k++;
            }
            printf("%d
    ",st.point);
        }
        return 0;
    }
  • 相关阅读:
    聊聊LiteOS事件模块的结构体、初始化及常用操作
    有了这个数据强一致“利器”,DBA们轻松修复数据对加班“say no”
    开源一周岁,MindSpore新特性巨量来袭
    90后就敢当扫地僧!不服?4月24号来闯龙门阵!
    你的数仓函数结果不稳定,可能是属性指定错了
    云小课 | 不了解EIP带宽计费规则?看这里!
    腾讯 angel 3.0:高效处理模型
    深度树匹配模型(TDM)
    X-Deep Learning功能模块
    XLearning
  • 原文地址:https://www.cnblogs.com/ccccnzb/p/3416659.html
Copyright © 2011-2022 走看看