zoukankan      html  css  js  c++  java
  • Alisha's Party

    Alisha’s Party

    Time Limit: 1 Sec  

    Memory Limit: 256 MB

    题目连接

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

    Description

    Princess Alisha invites her friends to come to her birthday party. Each of her friends will bring a gift of some value v, and all of them will come at a different time. Because the lobby is not large enough, Alisha can only let a few people in at a time. She decides to let the person whose gift has the highest value enter first.

    Each time when Alisha opens the door, she can decide to let p people enter her castle. If there are less than p people in the lobby, then all of them would enter. And after all of her friends has arrived, Alisha will open the door again and this time every friend who has not entered yet would enter.

    If there are two friends who bring gifts of the same value, then the one who comes first should enter first. Given a query n Please tell Alisha who the n−th person to enter her castle is.

    Input

    The first line of the input gives the number of test cases, T , where 1≤T≤15.

    In each test case, the first line contains three numbers k,m and q separated by blanks. k is the number of her friends invited where 1≤k≤150,000. The door would open m times before all Alisha’s friends arrive where 0≤m≤k. Alisha will have q queries where 1≤q≤100.

    The i−th of the following k lines gives a string Bi, which consists of no more than 200 English characters, and an integer vi, 1≤vi≤108, separated by a blank. Bi is the name of the i−th person coming to Alisha’s party and Bi brings a gift of value vi.

    Each of the following m lines contains two integers t(1≤t≤k) and p(0≤p≤k) separated by a blank. The door will open right after the t−th person arrives, and Alisha will let p friends enter her castle.

    The last line of each test case will contain q numbers n1,...,nq separated by a space, which means Alisha wants to know who are the n1−th,...,nq−th friends to enter her castle.

    Note: there will be at most two test cases containing n>10000.

    Output

    For each test case, output the corresponding name of Alisha’s query, separated by a space.
    Sample Input
    1
    5 2 3
    Sorey 3
    Rose 3
    Maltran 3
    Lailah 5
    Mikleo 6
    1 1
    4 2
    1 2 3
     
    Sample Output
    Sorey Lailah Rose
    好题,直接用结构体来写的话会时间超限,不断的用sort排序,但用优先队列的话,每次只往里面添加有限的个数只需遍历一遍。
    #include <iostream>
    #include <algorithm>
    #include <cstdio>
    #include <cstring>
    #include <queue>
    using namespace std;
    int k,m,p,pos[150007],x;
    struct Come
    {
        int vis;
        int num;
    }come[150007];
    bool cmp(Come a,Come b)
    {
        return a.vis<b.vis;
    }
    struct Node
    {
        int idx;
        int v;
        char name[210];
        friend bool operator<(Node x,Node y)
        {
            if(x.v==y.v) return x.idx>y.idx;
            return x.v<y.v;
        }
    }node[150007];
    int main()
    {
        int T;
        scanf("%d",&T);
        while(T--)
        {
            priority_queue<Node>q;
            scanf("%d%d%d",&k,&m,&p);
            for(int i=1;i<=k;i++)
            {
                scanf("%s%d",&node[i].name,&node[i].v);
                node[i].idx=i;
            }
            for(int i=0;i<m;i++)
            {
                scanf("%d%d",&come[i].vis,&come[i].num);
            }
            sort(come,come+m,cmp);
            int ans=1;
            int inf=1;
            for(int i=0;i<m;i++)
            {
                while(inf<=come[i].vis)//放入有限个数
                {
                    q.push(node[inf]);
                    inf++;
                }
                while(come[i].num && !q.empty())
                {
                    pos[ans++]=q.top().idx;
                    q.pop();
                    come[i].num--;
                }
            }
            while(inf<=k)
            {
                q.push(node[inf]);
                inf++;
            }
            while(!q.empty())
            {
                pos[ans++]=q.top().idx;
                q.pop();
            }
            for(int i=0;i<p;i++)
            {
                scanf("%d",&x);
                if(i) printf(" ");
                printf("%s",node[pos[x]].name);
            }
            printf("
    ");
        }
        return 0;
    }
  • 相关阅读:
    手工去除 dll 和 exe 文件的数字签名
    针式PKM中级应用:文件的5S(归档整理删除)
    针式PKM初级应用:如何避免收集重复的资料?
    了解更多:什么是个人知识管理?
    如何选用知识管理软件?
    与阿朱聊个人知识管理:体系和方法论层面
    针式PKM初级应用:针式PKM每天应使用多少小时?
    战略人生
    针式PKM初级应用:针式PKM更适合管理什么样的文件
    Data, Information, and Knowledge Management Software "What software should I use?"
  • 原文地址:https://www.cnblogs.com/shinianhuanniyijuhaojiubujian/p/6881798.html
Copyright © 2011-2022 走看看