oj.uz

답안 #957881

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
957881 2024-04-04T12:45:21 Z vjudge1 Abracadabra (CEOI22_abracadabra) C++17
35 / 100
 3000 ms 25892 KB 
#include<stdio.h>
#include<stdlib.h>

#define N 200004
int n,a[N],t[N],q,sz[N],at[N],*eh[N],eo[N],zz[1000005];

void upd(int p,int k) { for(;p<N;p|=p+1)t[p]+=k; }
int qry(int p) {int z=0;for(;p>0;p&=p-1)z+=t[p-1];return z;}

void add(int p,int k) { sz[p]=k; upd(p,k); }
void rem(int p) { upd(p,-sz[p]); }

int grp(int x)
{
    if(x<=0)return -1;
    int p=0,v=0;
    for(int j=1<<19;j>0;j>>=1) if(p+j<=N&&v+t[p+j-1]<x)p+=j,v+=t[p-1];
    return p;
}

void append(int i,int j)
{
    int o=eo[i]++;
    if(o>=2&&(o&o-1)==0)eh[i]=(int*)realloc(eh[i],2*o*sizeof**eh);
    eh[i][o]=j;
}

void shuffle()
{
    int g1=grp(n/2),g2=grp(n/2+1);
    if(g1!=g2)return;
    int rl=qry(g1);
    int st=at[g1];
    int md=n/2-rl+at[g1];
    int ed=at[g1]+sz[g1];
    for(int l=md,j=md;j<=ed;++j) if(j==ed||a[j]>a[l])add(a[l],j-l),l=j;
    rem(g1);
    add(g1,n/2-rl);
}

int main()
{
    scanf("%d%d",&n,&q);
    for(int i=1;i<=n;++i)scanf("%d",a+i),at[a[i]]=i;
    for(int l=1,i=1;i<=n+1;++i) if(i==n+1||a[i]>a[l]) add(a[l],i-l),l=i;

    for(int i=0;i<=n;++i)eh[i]=(int*)malloc(2*sizeof**eh);

    for(int t,p,i=0;i<q;++i)
    {
        scanf("%d%d",&t,&p);
        if(t>n)t=n;
        append(t,i),append(t,p);
    }

    for(int i=0;i<=n+1;++i)
    {
        for(int j=0;j<eo[i];j+=2)
        {
            int gg=grp(eh[i][j+1]);
            int idx=eh[i][j+1]-qry(gg);
            zz[eh[i][j]]=a[at[gg]+idx-1];
        }
        shuffle();
    }

    for(int i=0;i<q;++i)printf("%d\n",zz[i]);

    return 0;
}

Compilation message

Main.cpp: In function 'void append(int, int)':
Main.cpp:24:18: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   24 |     if(o>=2&&(o&o-1)==0)eh[i]=(int*)realloc(eh[i],2*o*sizeof**eh);
      |                 ~^~
Main.cpp: In function 'void shuffle()':
Main.cpp:33:9: warning: unused variable 'st' [-Wunused-variable]
   33 |     int st=at[g1];
      |         ^~
Main.cpp: In function 'int main()':
Main.cpp:43:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     scanf("%d%d",&n,&q);
      |     ~~~~~^~~~~~~~~~~~~~
Main.cpp:44:31: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |     for(int i=1;i<=n;++i)scanf("%d",a+i),at[a[i]]=i;
      |                          ~~~~~^~~~~~~~~~
Main.cpp:51:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         scanf("%d%d",&t,&p);
      |         ~~~~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 272 ms 23940 KB Output is correct
2 Correct 286 ms 22864 KB Output is correct
3 Correct 262 ms 22352 KB Output is correct
4 Correct 252 ms 22224 KB Output is correct
5 Correct 273 ms 24520 KB Output is correct
6 Correct 262 ms 25688 KB Output is correct
7 Correct 264 ms 25892 KB Output is correct
8 Correct 257 ms 23764 KB Output is correct
9 Correct 256 ms 22808 KB Output is correct
10 Correct 259 ms 22340 KB Output is correct
11 Correct 256 ms 22420 KB Output is correct
12 Correct 258 ms 21532 KB Output is correct
13 Correct 265 ms 21536 KB Output is correct
14 Correct 275 ms 24248 KB Output is correct
15 Correct 271 ms 22020 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 265 ms 21124 KB Output is correct
18 Correct 241 ms 20884 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6488 KB Output is correct

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3049 ms 20568 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 835 ms 10952 KB Output is correct
2 Correct 61 ms 11528 KB Output is correct
3 Correct 803 ms 11140 KB Output is correct
4 Correct 54 ms 11576 KB Output is correct
5 Correct 60 ms 11348 KB Output is correct
6 Correct 54 ms 11344 KB Output is correct
7 Correct 62 ms 11440 KB Output is correct
8 Correct 54 ms 11276 KB Output is correct
9 Correct 57 ms 11348 KB Output is correct
10 Correct 48 ms 11604 KB Output is correct
11 Correct 55 ms 11944 KB Output is correct
12 Correct 49 ms 11796 KB Output is correct
13 Correct 50 ms 11568 KB Output is correct
14 Correct 51 ms 11868 KB Output is correct
15 Correct 50 ms 11736 KB Output is correct
16 Correct 22 ms 9560 KB Output is correct
17 Correct 53 ms 11344 KB Output is correct
18 Correct 54 ms 11220 KB Output is correct
19 Correct 1 ms 6488 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 272 ms 23940 KB Output is correct
2 Correct 286 ms 22864 KB Output is correct
3 Correct 262 ms 22352 KB Output is correct
4 Correct 252 ms 22224 KB Output is correct
5 Correct 273 ms 24520 KB Output is correct
6 Correct 262 ms 25688 KB Output is correct
7 Correct 264 ms 25892 KB Output is correct
8 Correct 257 ms 23764 KB Output is correct
9 Correct 256 ms 22808 KB Output is correct
10 Correct 259 ms 22340 KB Output is correct
11 Correct 256 ms 22420 KB Output is correct
12 Correct 258 ms 21532 KB Output is correct
13 Correct 265 ms 21536 KB Output is correct
14 Correct 275 ms 24248 KB Output is correct
15 Correct 271 ms 22020 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 265 ms 21124 KB Output is correct
18 Correct 241 ms 20884 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6488 KB Output is correct
21 Execution timed out 3049 ms 20568 KB Time limit exceeded
22 Halted 0 ms 0 KB -