# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
59958 | 2018-07-23T11:27:05 Z | theknife2001 | Dancing Elephants (IOI11_elephants) | C++17 | 0 ms | 0 KB |
#include "elephants.h" #include<bits/stdc++.h> int n; int ind[50005]; int ind1[50005]; int l; void init(int N, int L, int X[]) { for(int i=0;i<N;i++) ind[i]=X[i]; l=L; n=N; } int update(int i, int y) { ind[i]=y; for(int i=0;i<n;i++) ind1[i]=ind[i]; sort(ind1,ind1+n); int cnt=1; int last=ind1[0]; for(int i=1;i<n;i++) { if(last+l<ind1[i]) { cnt++; last=ind1[i]; } } return cnt; }