| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 874426 | 12345678 | Dancing Elephants (IOI11_elephants) | C++17 | 9023 ms | 14588 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;
const int nx=150005;
int n, l, v[nx];
multiset<int> ms;
void init(int N, int L, int X[])
{
n=N; l=L;
for (int i=0; i<N; i++) v[i]=X[i], ms.emplace(X[i]);
}
int update(int i, int y)
{
ms.erase(ms.find(v[i]));
v[i]=y;
ms.insert(v[i]);
int tmp=INT_MIN, cnt=0;
for (auto x:ms) if (x>tmp) cnt++, tmp=x+l;
return cnt;
}
| # | 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... | ||||
