zoukankan      html  css  js  c++  java
  • POJ 2828 Buy Tickets

    Buy Tickets
    Time Limit: 4000MS   Memory Limit: 65536K
    Total Submissions: 10858   Accepted: 5272

    Description

    Railway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a long queue…

    The Lunar New Year was approaching, but unluckily the Little Cat still had schedules going here and there. Now, he had to travel by train to Mianyang, Sichuan Province for the winter camp selection of the national team of Olympiad in Informatics.

    It was one o’clock a.m. and dark outside. Chill wind from the northwest did not scare off the people in the queue. The cold night gave the Little Cat a shiver. Why not find a problem to think about? That was none the less better than freezing to death!

    People kept jumping the queue. Since it was too dark around, such moves would not be discovered even by the people adjacent to the queue-jumpers. “If every person in the queue is assigned an integral value and all the information about those who have jumped the queue and where they stand after queue-jumping is given, can I find out the final order of people in the queue?” Thought the Little Cat.

    Input

    There will be several test cases in the input. Each test case consists of N + 1 lines where N (1 ≤ N ≤ 200,000) is given in the first line of the test case. The next N lines contain the pairs of values Posi and Vali in the increasing order of i (1 ≤ iN). For each i, the ranges and meanings of Posi and Vali are as follows:

    • Posi ∈ [0, i − 1] — The i-th person came to the queue and stood right behind the Posi-th person in the queue. The booking office was considered the 0th person and the person at the front of the queue was considered the first person in the queue.
    • Vali ∈ [0, 32767] — The i-th person was assigned the value Vali.

    There no blank lines between test cases. Proceed to the end of input.

    Output

    For each test cases, output a single line of space-separated integers which are the values of people in the order they stand in the queue.

    Sample Input

    4
    0 77
    1 51
    1 33
    2 69
    4
    0 20523
    1 19243
    1 3890
    0 31492

    Sample Output

    77 33 69 51
    31492 20523 3890 19243

    Hint

    The figure below shows how the Little Cat found out the final order of people in the queue described in the first test case of the sample input.

    Source

    POJ Monthly--2006.05.28, Zhu, Zeyuan
      
        郁闷了很多天后,终于憋不住了看了看解题报告,然后。。。
    #include <iostream>
    #include <cstring>
    #include <cstdio>
    #include <cmath>
    #define N 200010
    using namespace std;
    struct num
    {
        int l,r,sum;
    }a[4*N];
    struct inf
    {
        int sum,val;
    }in[N];
    int sa[N],res;
    int main()
    {
        //freopen("data.in","r",stdin);
        void pre_build(int k,int l,int r);
        void find(int k,int sum);
        int n;
        while(scanf("%d",&n)!=EOF)
        {
            for(int i=1;i<=n;i++)
            {
                scanf("%d %d",&in[i].sum,&in[i].val);
            }
            pre_build(1,1,n);
            for(int i=n;i>=1;i--)
            {
                find(1,in[i].sum+1);
                sa[res] = i;
            }
            for(int i=1;i<=n;i++)
            {
                if(i==1)
                {
                    printf("%d",in[sa[i]].val);
                }else
                {
                    printf(" %d",in[sa[i]].val);
                }
            }
            printf("
    ");
        }
        return 0;
    }
    void pushup(int k)
    {
        a[k].sum=a[k<<1].sum+a[k<<1|1].sum;
    }
    void pre_build(int k,int l,int r)
    {
        a[k].l=l; a[k].r = r;
        if(l==r)
        {
            a[k].sum=1;
            return ;
        }
        int mid=(l+r)>>1;
        pre_build(k<<1,l,mid);
        pre_build(k<<1|1,mid+1,r);
        pushup(k);
    }
    void find(int k,int sum)
    {
        if(a[k].l==a[k].r)
        {
            res = a[k].l;
            a[k].sum=0;
            return ;
        }
        if(a[k<<1].sum>=sum)
        {
            find(k<<1,sum);
        }else
        {
            find(k<<1|1,sum-a[k<<1].sum);
        }
        pushup(k);
    }
    


  • 相关阅读:
    如何优雅地用Redis实现分布式锁?
    redis 持久化有几种方式?
    怎么保证缓存和数据库数据的一致性?
    jedis 和 redisson 有哪些区别?
    redis支持哪些数据类型?redis命令大全
    什么是redis的缓存雪崩与缓存穿透?如何解决?
    redis 为什么是单线程的?
    什么是memecache?redis 和 memecache 有什么区别?
    Redis入门到精通(九)——Redis数据库基本操作(切换数据库,数据移动,删除数据)
    Redis入门到精通(八)——key通用指令基本操作、key扩展操作(时效性控制、查询模式)、key其他操作(为key改名)
  • 原文地址:https://www.cnblogs.com/james1207/p/3301593.html
Copyright © 2011-2022 走看看