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 <bits/stdc++.h>
#include "elephants.h"
using namespace std;
int n;
int l;
int *x;
map<int,int>mp;
void init(int N, int L, int X[])
{
n = N;
l=L;
x=X;
for(int i = 0;i<n;i++){
mp[x[i]]++;
}
}
int update(int i, int y)
{
mp[x[i]]--;
if(mp[x[i]]==0){
mp.erase(x[i]);
}
x[i]=y;
mp[x[i]]++;
int ans = 1;
int las = (*mp.begin()).first;
for(pair<int,int>p:mp){
if(p.first-las>l){
las=p.first;
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... |