#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pr = pair<int, int>;
#define pb push_back
const int INF = 1e9+7;
int n, k;
vector<int> a;
multiset<int> cur;
int count() {
auto it = cur.begin();
int res = 0;
while (it != cur.end()) {
res++;
it = cur.upper_bound(*it + k);
}
return res;
}
void init(int N, int L, int X[]) {
n = N; k = L;
a.resize(n);
for (int i = 0; i < n; i++) {
a[i] = X[i];
cur.insert(a[i]);
}
}
int update(int i, int y) {
cur.erase(cur.find(a[i]));
a[i] = y;
cur.insert(y);
return count();
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |