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>
#pragma GCC optimize(2)
using namespace std;
int n,l;
int arr[50100];
set<int>st;
void init(int N, int L, int X[]){
n = N;
l=L;
for(int i=0;i<N;i++)
st.insert(arr[i]=X[i]);
}
int update(int i, int y) {
st.erase(arr[i]);
st.insert(arr[i]=y);
int ans=0,lst=-1e9;
for(auto b:st)
if(lst+l<b)
lst=b,ans++;
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... |