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 "elephants.h"
#include <bits/stdc++.h>
using namespace std;
int n, l;
vector<int> x;
multiset<int> poss;
void init(int N, int L, int X[]) {
n = N, l = L;
for (int i = 0; i < N; ++i) {
x.push_back(X[i]);
poss.insert(X[i]);
}
}
int update(int i, int y) {
poss.erase(x[i]);
x[i] = y;
poss.insert(x[i]);
int ans = 0;
for (auto it = poss.begin(); it != poss.end(); ans++) {
it = poss.upper_bound(*it + l);
}
return ans;
}
# | 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... |