# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
671692 | 2022-12-13T14:52:49 Z | Hacv16 | Dancing Elephants (IOI11_elephants) | C++17 | 0 ms | 0 KB |
#include "elephants.h" #include<bits/stdc++.h> typedef long long ll; const int MAX = 2e6 + 15; int n, l, x[MAX]; multiset<int> s; void init(int n_, int l_, int x_[]){ n = n_, l = l_; for(int i = 0; i < n; i++) x[i] = x_[i], s.insert(x[i]); } int update(int i, int y){ s.erase(s.find(x[i])); s.insert(y); x[i] = y; int ans = 0, r = -1; for(auto x : s) if(x > r) ans++, r = x + l; return ans; }