oj.uz

Submission #59952

# Submission time Handle Problem Language Result Execution time Memory
59952 2018-07-23T11:16:24 Z theknife2001 Dancing Elephants (IOI11_elephants) C++17
0 / 100
 2 ms 248 KB 
int n;
int ind[50005];
int l;

void init(int N, int L, int X[])
{
    for(int i=0;i<N;i++)
        ind[i]=X[i];
    l=L;
    n=N;
}

int update(int i, int y)
{
    ind[i]=y;
    int cnt=1;
    int last=ind[0];
    for(int i=1;i<n;i++)
    {
        if(last+l<ind[i])
        {
            cnt++;
            last=ind[i];
        }
    }
    return cnt;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 16.0

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

Subtask #3
0 / 24.0

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

Subtask #4
0 / 47.0

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

Subtask #5
0 / 3.0

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