Submission #538373

#TimeUsernameProblemLanguageResultExecution timeMemory
538373tabrDancing Elephants (IOI11_elephants)C++17
26 / 100
9015 ms1880 KiB
#include <bits/stdc++.h> using namespace std; #ifdef tabr #include "library/debug.cpp" #else #define debug(...) #endif int n; int l; vector<int> x; void init(int n_, int l_, int x_[]) { n = n_; l = l_; x = vector<int>(n); for (int i = 0; i < n; i++) { x[i] = x_[i]; } } int update(int i, int y) { x[i] = y; auto a = x; sort(a.begin(), a.end()); int ans = 1; int now = a[0]; while (now + l < a[n - 1]) { now = *upper_bound(a.begin(), a.end(), now + l); ans++; } return ans; } #ifdef tabr int main() { ios::sync_with_stdio(false); cin.tie(0); return 0; } #endif
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...