zoukankan      html  css  js  c++  java
  • ZOJ 3635 Cinema in Akiba[ 大规模阵列 ]

    门户:ZOJ 3635

    Cinema in Akiba

    Time Limit: 3 Seconds      Memory Limit: 65536 KB

    Cinema in Akiba (CIA) is a small but very popular cinema in Akihabara. Every night the cinema is full of people. The layout ofCIA is very interesting, as there is only one row so that every audience can enjoy the wonderful movies without any annoyance by other audiences sitting in front of him/her.

    The ticket for CIA is strange, too. There are n seats in CIA and they are numbered from 1 to n in order. Apparently, n tickets will be sold everyday. When buying a ticket, if there are k tickets left, your ticket number will be an integeri (1 ≤ ik), and you should choose the ith empty seat (not occupied by others) and sit down for the film.

    On November, 11th, n geeks go to CIA to celebrate their anual festival. The ticket number of theith geek is ai. Can you help them find out their seat numbers?

    Input

    The input contains multiple test cases. Process to end of file.
    The first line of each case is an integer n (1 ≤ n ≤ 50000), the number of geeks as well as the number of seats inCIA. Then follows a line containing n integers a1,a2, ..., an (1 ≤ ain - i + 1), as described above. The third line is an integerm (1 ≤ m ≤ 3000), the number of queries, and the next line ism integers, q1, q2, ..., qm (1 ≤ qin), each represents the geek's number and you should help him find his seat.

    Output

    For each test case, print m integers in a line, seperated by one space. Theith integer is the seat number of the qith geek.

    Sample Input

    3
    1 1 1
    3
    1 2 3
    5
    2 3 3 2 1
    5
    2 3 4 5 1
    

    Sample Output

    1 2 3
    4 5 3 1 2
    


    思路:链表模拟一排座位1-n,不断删除,然后记录座位号。用普通的链表模拟。必定TLE。so上块状链表。来弥补链表索引太慢的缺点。


    代码:


    #include<cstdio>
    #include<iostream>
    #include<cstring>
    #include<cmath>
    #include<vector>
    #include<algorithm>
    #include<climits>
    #define INF INT_MAX
    using namespace std;
    
    struct node{
        int num[1000];
        int sz;
        node* next;
        node(int sz){
            this->sz=sz;
            next=0;
        }
    }*head=NULL;
    
    int local[50010];
    node *get_pos(int &x)
    {
        node *t=head->next;
        while(t->next&&x>t->sz)
        {
            x-=t->sz;
            t=t->next;
        }
        return t;
    }
    
    void del(node *pos,int x,int ii)
    {
        local[ii]=(pos->num)[x-1];
        for(int i=x;i<pos->sz;i++)
            (pos->num)[i-1]=(pos->num)[i];
        (pos->sz)--;
    }
    
    void build_bl(int n)
    {
        node *ret=head;
        int sz=ceil(sqrt(n));
        int cur=0;
        for(int i=0;i<n/sz;i++)
        {
            node *t=new node(sz);
            for(int j=0;j<sz;j++)
                (t->num)[j]=(++cur);
    
            ret->next=t;
            ret=t;
        }
    
        if(n%sz)
        {
            node *t=new node(n%sz);
            for(int i=0;i<n%sz;i++)
                (t->num)[i]=(++cur);
            ret->next=t;
        }
    }
    
    void free_head()
    {
        node *p=head;
        while(head->next)
        {
            head=head->next;
            free(p);
            p=head;
        }
    }
    
    int main()
    {
        int n,m;
        while(scanf("%d",&n)!=EOF)
        {
            head=new node(0);
            build_bl(n);
            for(int i=1;i<=n;i++)
            {
                //printf("__hear
    ");
                int x;
                scanf("%d",&x);
                node *pos=get_pos(x);
                del(pos,x,i);
            }
            free_head();
            scanf("%d",&m);
            int q;
            scanf("%d",&q);
            printf("%d",local[q]);
            for(int i=1;i<m;i++)
            {
                scanf("%d",&q);
                printf(" %d",local[q]);
            }
            printf("
    ");
        }
        return 0;
    }
    




    版权声明:欢迎follow我的开源项目:https://github.com/skyqinsc

  • 相关阅读:
    js数组的用法以及数组根据下标(数值或字符)移除元素
    组件创建、组件注册方式
    vue.runtime.esm.js:593 [Vue warn]: Invalid prop: custom validator check failed for prop "value".报错解决
    uni-app 子组件如何调用父组件的方法
    wap2app(十)--wap2app 添加原生底部导航,添加原生标题栏,填坑
    wap2app(九)-- 使用mui.previewImage之后,页面a链接不能跳转
    wap2app(八)-- iphoneX 底部导航的兼容问题
    wap2app(七)-- 长按保存图片
    我的新书《Android App开发从入门到精通》终于出版啦
    Android微信登录、分享、支付
  • 原文地址:https://www.cnblogs.com/blfshiye/p/4827338.html
Copyright © 2011-2022 走看看