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, pos[70010], l;
multiset<int> S;
void init(int N, int L, int X[])
{
n = N; l = L;
for(int i = 0; i < n; i++)
pos[i] = X[i], S.insert(X[i]);
}
int update(int i, int y)
{
S.erase(S.find(pos[i]));
S.insert(y);
int cur = *S.begin(), cnt = 1;
for(auto u : S)
if(cur+l<u) cur = u, cnt++;
return cnt;
}
# | 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... |