| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 249787 | eohomegrownapps | Dancing Elephants (IOI11_elephants) | C++14 | 0 ms | 0 KiB |
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;
set<int> elephants;
vector<int> elpos;
void init(int N, int L, int X[]) {
n=N;l=L;
elpos.resize(n);
dp.resize(n);
for (int i = 0; i<n; i++){
elpos[i]=X[i];
elephants.insert(X[i]);
}
}
int update(int i, int y) {
elephants.erase(elpos[i]);
elpos[i]=y;
elephants.insert(y);
int ptr = 0;
auto it = elephants.begin();
while (it!=elephants.end()){
ptr++;
it = elephants.upper_bound(*it+l);
}
return ptr;
}
/*int main(){
int arr[50000];
for (int i = 0; i<50000; i++){
arr[i]=i*10;
}
init(50000,100,arr);
for (int i = 0; i<50000; i++){
if (i%1000==0){cout<<i<<'\n';}
update(235, 24585);
}
}*/
