# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
964809 | Trisanu_Das | Dancing Elephants (IOI11_elephants) | C++17 | 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>
using namespace std;
#define ll long long
ll l, a[150005], a_[150005];
int n;
void init(int N, int L, int X[]){
n = N; l = L;
a_[0] = INT_MIN, a_[n + 1] = INT_MAX;
for(int i = 0; i < n; i++) a_[i + 1] = a[i] = X[i];
}
int update(int idx, ll val){
int i = 0;
while(a_[i] != a[idx]) ++i;
a_[i] = a[idx] = val;
while(a_[i - 1] > a_[i]) swap(a_[i - 1], a_[i]), i--;
while(a_[i + 1] < a_[i]) swap(a_[i + 1], a_[i]); i++;
int ans = 1; ll last = a_[1];
for(int i = 2; i <= n; i++)
if(a_[i] - last > l) ++ans, last = a_[i];
return ans;
}