oj.uz

Submission #18806

# Submission time Handle Problem Language Result Execution time Memory
18806 2016-02-15T20:30:30 Z ggoh Jousting tournament (IOI12_tournament) C++
0 / 100
 28 ms 5772 KB 
#include<cstdio>
#include<set>


int maxx=-1,l,j,X,a,u,p,q,sz,seg[1<<18],w[100003],ss[100003],ee[100003],sum[100003],b,c,i,x[100002],st[100002],en[100002],d[100004];
bool check[100002];
int segloc(int num,int s,int e,int co)
{
    if(s==e)return s;
    if(seg[num*2]<=co)return segloc(num*2+1,(s+e)/2+1,e,co-seg[num*2]);
    else return segloc(num*2,s,(s+e)/2,co);
}
int GetBestPosition(int N, int C, int R, int *K, int *S, int *E)
{
    a=N;
    b=C;
    X=1<<17;
    for(i=0;i<a;i++)
    {
        seg[X+i]=1;
        q=X+i;q/=2;
        while(q)
        {
            seg[q]=seg[2*q]+seg[2*q+1];
            q/=2;
        }
        ee[i]=ss[i]=i;
    }
    for(i=0;i<b;i++)
    {
        u=segloc(1,0,X-1,S[i]);
        for(j=1;j<E[i]-S[i];j++)
        {
            p=segloc(1,0,X-1,S[i]+1);
            ss[p]=ee[p]=0;
            seg[X+p]=0;
            q=X+p;q/=2;
            while(q)
            {
                seg[q]=seg[2*q]+seg[2*q+1];
                q/=2;
            }
        }
        p=segloc(1,0,X-1,S[i]+1);
        ss[p]=ee[p]=0;
        seg[X+p]=0;
        q=X+p;q/=2;
        while(q)
        {
            seg[q]=seg[2*q]+seg[2*q+1];
            q/=2;
        }
        ee[u]=ee[p];
        st[i]=ss[u];en[i]=ee[u];
    }

    for(i=0;i<a-1;i++){if(K[i]>R)x[i]=1;else x[i]=0;}
    sum[0]=x[0];
    for(i=1;i<a-1;i++)sum[i]=sum[i-1]+x[i];
    for(i=0;i<b;i++)
    {
        if(sum[en[i]-1]-(st[i]?sum[st[i]-1]:0)==0)check[i]=1;
        else check[i]=0;
    }
    for(i=0;i<b;i++)if(check[i])
    {
        d[st[i]]++;
        d[en[i]+1]--;
    }
    c=0;
    for(i=0;i<a;i++)
    {
        c+=d[i];
        if(c>maxx)maxx=c,l=i;
    }
    return l;
}

Subtask #1
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 5328 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 5328 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 51.0

# Verdict Execution time Memory Grader output
1 Incorrect 28 ms 5772 KB Output isn't correct
2 Halted 0 ms 0 KB -