oj.uz

Submission #18805

# Submission time Handle Problem Language Result Execution time Memory
18805 2016-02-15T18:30:42 Z ggoh Jousting tournament (IOI12_tournament) C++
49 / 100
 1000 ms 4360 KB 
#include<cstdio>
#include<set>


int maxx=-1,l,j,a,sz,ss[100003],ee[100003],sum[100003],b,c,i,x[100002],st[100002],en[100002],d[100004];
bool check[100002];
int GetBestPosition(int N, int C, int R, int *K, int *S, int *E)
{
    a=N;
    b=C;
    for(i=0;i<a;i++)ss[sz]=i,ee[sz]=i,sz++;
    for(i=0;i<b;i++)
    {
        st[i]=ss[S[i]];
        en[i]=ee[E[i]];
        ss[S[i]]=st[i];ee[S[i]]=en[i];
        for(j=E[i]+1;j<sz;j++)
        {
            ss[j-(E[i]-S[i])]=ss[j];
            ee[j-(E[i]-S[i])]=ee[j];
        }
        sz=sz-(E[i]-S[i]);
    }

    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
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3916 KB Output is correct
2 Correct 0 ms 3916 KB Output is correct
3 Correct 0 ms 3916 KB Output is correct
4 Correct 0 ms 3916 KB Output is correct
5 Correct 0 ms 3916 KB Output is correct
6 Correct 0 ms 3916 KB Output is correct
7 Correct 0 ms 3916 KB Output is correct
8 Correct 0 ms 3916 KB Output is correct
9 Correct 0 ms 3916 KB Output is correct
10 Correct 0 ms 3916 KB Output is correct

Subtask #2
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3916 KB Output is correct
2 Correct 12 ms 3916 KB Output is correct
3 Correct 2 ms 3916 KB Output is correct
4 Correct 21 ms 3916 KB Output is correct
5 Correct 17 ms 3916 KB Output is correct
6 Correct 15 ms 3916 KB Output is correct
7 Correct 13 ms 3916 KB Output is correct
8 Correct 22 ms 3916 KB Output is correct
9 Correct 0 ms 3916 KB Output is correct
10 Correct 19 ms 3916 KB Output is correct

Subtask #3
0.0 / 51.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1000 ms 4360 KB Program timed out
2 Halted 0 ms 0 KB -