oj.uz

Submission #411275

# Submission time Handle Problem Language Result Execution time Memory
411275 2021-05-24T21:44:01 Z LouayFarah Dancing Elephants (IOI11_elephants) C++14
0 / 100
 1 ms 332 KB 
#include "bits/stdc++.h"
#include "elephants.h"
using namespace std;
 
int n, l;
int *x;
 
void init(int N, int L, int X[])
{
    n = N;
    l = L;
    x = X;
}
 
int solve()
{
    int len = x[0];
    len+=l;
    int res = 1;
    for(int j = 1; j<n; j++)
    {
        if(x[j]>len)
        {
            res++;
            len+=l;
        }
    }
 
    return res;
}
 
int update(int i, int y)
{
    x[i] = y;
    int j = i;
    while(j<n-1)
    {
        if(x[i]>x[i+1])
            swap(x[i], x[i+1]);
        else
            break;
        j++;
    }
    j = i;
    while(j>0)
    {
        if(x[i]<x[i-1])
            swap(x[i], x[i-1]);
        else
            break;
        j--;
    }
 
    int res = solve();
    return res;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 16.0

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

Subtask #3
0 / 24.0

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

Subtask #4
0 / 47.0

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

Subtask #5
0 / 3.0

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