# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
411274 | 2021-05-24T21:43:40 Z | LouayFarah | Dancing Elephants (IOI11_elephants) | C++14 | 0 ms | 0 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(n, l, x); return res; }