#include "elephants.h"
#include <math.h>
#include <set>
#include <vector>
using namespace std;
int N, L;
vector<int> positions;
set<int> elephants;
void init(int n, int l, int X[]) {
N = n;
L = l;
for (int i = 0; i < N; i++) {
elephants.insert(X[i]);
positions.push_back(X[i]);
}
return;
}
int update(int i, int y) {
int key = positions[i];
positions[i] = y;
auto it = elephants.find(key);
elephants.erase(it);
elephants.insert(y);
int ret = 0;
int container = -1;
for (auto e : elephants) {
if (container < e) {
ret++;
container = e + L;
}
}
return ret;
}
# | 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... |