| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 900265 | Muhammad_Aneeq | Dancing Elephants (IOI11_elephants) | C++17 | 9056 ms | 8284 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 <set>
#include "elephants.h"
using namespace std;
int const MAXN=2e5+10;
int pos[MAXN]={};
multiset<int>s;
int l;
void init(int N, int L, int X[])
{
l=L;
for (int i=0;i<N;i++)
{
pos[i]=X[i];
s.insert(X[i]);
}
}
int update(int i, int y)
{
s.erase(s.find(pos[i]));
pos[i]=y;
s.insert(y);
int z=0;
auto f=begin(s);
while (f!=s.end())
{
f=s.upper_bound(*f+l);
z++;
}
return z;
}| # | 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... | ||||
