oj.uz

Submission #233344

# Submission time Handle Problem Language Result Execution time Memory
233344 2020-05-20T09:25:16 Z LittleFlowers__ Xylophone (JOI18_xylophone) C++14
47 / 100
 179 ms 47072 KB 
#include <iostream>
using namespace std;

//#define unx xun

#ifndef unx
#include "xylophone.h"
#endif

#ifdef unx

int n;
int a[5010];

int query(int s,int t){
    int mx=0, mn=5000;
    for(int i=s;i<=t;++i) mx=mx>a[i]?mx:a[i], mn=mn>a[i]?a[i]:mn;
    return mx-mn;
}
void answer(int i,int val){
    cout<<val<<" ";
}

#endif

int ans[5010], pos[5010];
int asked[5010][5010], dd[5010][5010];

int ask(int s,int t){
    if(asked[s][t]) return asked[s][t]; else return asked[s][t]=query(s,t);
}

void dfs(int l,int r,int p){
    if(l>=r || dd[l][r]++) return;
    if(p<0){ p=-p;
        if(p==l){
            int val=ask(l,r), t=l;
            for(int j=12;j>=0;--j){
                t+=1<<j;
                if(t<=r && ask(l,t)<val); else t-=1<<j;
            } t++;
            ans[val+pos[p]]=t; pos[t]=val+pos[p];
            dfs(l+1,t,t); dfs(t,r,t);
        } else{
            int val=ask(l,r), t=r;
            for(int j=12;j>=0;--j){
                t-=1<<j;
                if(t>=l && ask(t,r)<val); else t+=1<<j;
            } t--;
            ans[val+ans[p]]=t; pos[t]=val+pos[p];
            dfs(l,t,t); dfs(t,r-1,t);
        }
    } else{
        if(p==l){
            int val=ask(l,r), t=l;
            for(int j=12;j>=0;--j){
                t+=1<<j;
                if(t<=r && ask(l,t)<val); else t-=1<<j;
            } t++;
            ans[pos[p]-val]=t; pos[t]=pos[p]-val;
            dfs(l+1,t,-t); dfs(t,r,-t);
        } else{
            int val=ask(l,r), t=r;
            for(int j=12;j>=0;--j){
                t-=1<<j;
                if(t>=l && ask(t,r)<val); else t+=1<<j;
            } t--;
            ans[pos[p]-val]=t; pos[t]=pos[p]-val;
            dfs(l,t,-t); dfs(t,r-1,-t);
        }
    }
}

void solve(int n){
    int l=1,r=n;
    for(int i=12;i>=0;--i){
        l+=1<<i;
        if(l<=n && ask(l,r)==n-1); else l-=1<<i;
    }
    for(int i=12;i>=0;--i){
        r-=1<<i;
        if(l<=r && ask(l,r)==n-1); else r+=1<<i;
    }
    ans[1]=l, ans[n]=r, pos[l]=1, pos[r]=n;
    dfs(1,l,-l); dfs(l,r-1,-l); dfs(r,n,r);
    for(int i=1;i<=n;++i) answer(i,pos[i]);
}

/**
4,1,3,5,2
*/

#ifdef unx
main(){
    freopen("tmp.inp","r",stdin);

    cin>>n;
    for(int i=1;i<=n;++i) cin>>a[i];
    //cout<<solve(n)<<"\n";
    solve(n);
}
#endif

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 416 KB Output is correct
3 Correct 6 ms 640 KB Output is correct
4 Correct 7 ms 896 KB Output is correct
5 Correct 12 ms 768 KB Output is correct
6 Correct 8 ms 896 KB Output is correct
7 Correct 6 ms 900 KB Output is correct
8 Correct 8 ms 1024 KB Output is correct
9 Correct 10 ms 768 KB Output is correct
10 Correct 13 ms 1152 KB Output is correct
11 Correct 8 ms 1024 KB Output is correct
12 Correct 8 ms 1024 KB Output is correct
13 Correct 9 ms 1024 KB Output is correct
14 Correct 8 ms 1024 KB Output is correct
15 Correct 8 ms 896 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 416 KB Output is correct
3 Correct 6 ms 640 KB Output is correct
4 Correct 7 ms 896 KB Output is correct
5 Correct 12 ms 768 KB Output is correct
6 Correct 8 ms 896 KB Output is correct
7 Correct 6 ms 900 KB Output is correct
8 Correct 8 ms 1024 KB Output is correct
9 Correct 10 ms 768 KB Output is correct
10 Correct 13 ms 1152 KB Output is correct
11 Correct 8 ms 1024 KB Output is correct
12 Correct 8 ms 1024 KB Output is correct
13 Correct 9 ms 1024 KB Output is correct
14 Correct 8 ms 1024 KB Output is correct
15 Correct 8 ms 896 KB Output is correct
16 Correct 11 ms 1792 KB Output is correct
17 Correct 20 ms 3304 KB Output is correct
18 Correct 31 ms 5496 KB Output is correct
19 Correct 38 ms 6648 KB Output is correct
20 Correct 39 ms 6392 KB Output is correct
21 Correct 39 ms 6776 KB Output is correct
22 Correct 42 ms 6648 KB Output is correct
23 Correct 69 ms 5112 KB Output is correct
24 Correct 88 ms 5880 KB Output is correct
25 Correct 96 ms 10336 KB Output is correct
26 Correct 38 ms 6520 KB Output is correct
27 Correct 39 ms 6648 KB Output is correct
28 Correct 36 ms 6776 KB Output is correct
29 Correct 40 ms 6752 KB Output is correct
30 Correct 40 ms 6776 KB Output is correct

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 416 KB Output is correct
3 Correct 6 ms 640 KB Output is correct
4 Correct 7 ms 896 KB Output is correct
5 Correct 12 ms 768 KB Output is correct
6 Correct 8 ms 896 KB Output is correct
7 Correct 6 ms 900 KB Output is correct
8 Correct 8 ms 1024 KB Output is correct
9 Correct 10 ms 768 KB Output is correct
10 Correct 13 ms 1152 KB Output is correct
11 Correct 8 ms 1024 KB Output is correct
12 Correct 8 ms 1024 KB Output is correct
13 Correct 9 ms 1024 KB Output is correct
14 Correct 8 ms 1024 KB Output is correct
15 Correct 8 ms 896 KB Output is correct
16 Correct 11 ms 1792 KB Output is correct
17 Correct 20 ms 3304 KB Output is correct
18 Correct 31 ms 5496 KB Output is correct
19 Correct 38 ms 6648 KB Output is correct
20 Correct 39 ms 6392 KB Output is correct
21 Correct 39 ms 6776 KB Output is correct
22 Correct 42 ms 6648 KB Output is correct
23 Correct 69 ms 5112 KB Output is correct
24 Correct 88 ms 5880 KB Output is correct
25 Correct 96 ms 10336 KB Output is correct
26 Correct 38 ms 6520 KB Output is correct
27 Correct 39 ms 6648 KB Output is correct
28 Correct 36 ms 6776 KB Output is correct
29 Correct 40 ms 6752 KB Output is correct
30 Correct 40 ms 6776 KB Output is correct
31 Correct 87 ms 14200 KB Output is correct
32 Correct 106 ms 20376 KB Output is correct
33 Runtime error 179 ms 47072 KB Execution killed with signal 11 (could be triggered by violating memory limits)
34 Halted 0 ms 0 KB -