Submission #64110

#TimeUsernameProblemLanguageResultExecution timeMemory
64110zubecDancing Elephants (IOI11_elephants)C++14
26 / 100
9080 ms3016 KiB
#include "elephants.h" #include <bits/stdc++.h> using namespace std; int n, l, a[200100]; multiset <int> q; void init(int N, int L, int X[]){ l = L; for (int i = 0; i < N; i++){ a[i] = X[i]; q.insert(X[i]); } } int update(int i, int y){ int ans = 0; int pos = -1; q.erase(a[i]); a[i] = y; q.insert(a[i]); for (auto it = q.begin(); it != q.end(); it++){ if (pos < *it){ ++ans; pos = *it+l; } } return ans; } /** 4 10 5 10 15 17 20 2 16 1 1 25 2 3 35 2 0 38 2 2 0 3 */
#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...