# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
411272 | LouayFarah | Dancing Elephants (IOI11_elephants) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
#include "elephants.h"
using namespace std;
int n, l;
int x[150001];
void init(int N, int L, int X[])
{
n = N;
l = L;
x = X;
}
int solve(int n, int l, int x[])
{
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(n, l, x);
return res;
}