| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1130238 | sohamsen15 | Dancing Elephants (IOI11_elephants) | C++20 | 0 ms | 0 KiB | 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 999999;
vector<ll> a;
ll n, l;
void init(ll N, ll L, vector<ll> X) {
    n = N; l = L;
    for (auto x: X) a.push_back(x);
}
ll update(ll idx, ll y) {
    a[idx] = y;
    vector<ll> b; for (auto &x: a) b.push_back(x);
    sort(b.begin(), b.end());
    ll ans = 0;
    for (ll i = 0; i < n;) {
        ans++;
        bool done = false;
        for (ll j = i + 1; j < n; j++) {
            if (b[j] - b[i] > l) {
                done = true;
                i = j; break;
            } else if (j == n - 1) {
                i = n;
                done = true;
            }
        }
        if (!done) i++;
    }
    return ans;
}
