# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1076616 | ArthuroWich | Dancing Elephants (IOI11_elephants) | C++17 | 9048 ms | 10332 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;
vector<int> a;
multiset<int> p;
void init(int N, int L, int X[]) {
n = N, l = L;
a.resize(n);
for (int i = 0; i < n; i++) {
a[i] = X[i];
p.insert(X[i]);
}
}
int update(int i, int y) {
p.erase(p.find(a[i]));
a[i] = y;
p.insert(a[i]);
int ans = 0, be;
auto ind = p.begin();
while(ind != p.end()) {
ans++;
ind = p.upper_bound(*ind+l);
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |