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;
int A[101010];
multiset<int> S;
void init(int n, int l, int X[])
{
N=n, L=l;
for (int i=0; i<N; i++){
A[i] = X[i];
S.insert(X[i]);
}
}
int update(int i, int y)
{
S.erase(S.find(A[i]));
A[i] = y;
S.insert(y);
int ans=0, k=-1234567890;
for (int it : S) if (k+L < it) ans++, k=it;
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... |