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 <set>
#include <vector>
#include <algorithm>
using namespace std;
int N,L;
set<int> E;
vector<int> x;
void init(int _N, int _L, int X[]){
N = _N;
L = _L;
E.insert(X, X+N);
x.assign(X, X+N);
}
int update(int i, int y){
E.erase(x[i]);
E.insert(y);
x[i] = y;
set<int>::iterator it = E.begin();
int count = 0;
while (it != E.end()){
count++;
it = E.upper_bound(*it + L);
}
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... |