# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
764338 | boris_mihov | Dancing Elephants (IOI11_elephants) | C++17 | 9097 ms | 2132 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 <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <random>
#include <vector>
#include <set>
typedef long long llong;
const int MAXN = 150000 + 10;
const int INF = 2e9;
int n, len;
int a[MAXN];
int x[MAXN];
void init(int N, int L, int X[])
{
n = N;
len = L;
for (int i = 0 ; i < n ; ++i)
{
a[i + 1] = x[i + 1] = X[i];
}
}
int update(int idx, int y)
{
idx++;
int pos;
for (int i = 1 ; i <= n ; ++i)
{
if (a[i] == x[idx])
{
a[i] = y;
pos = i;
break;
}
}
x[idx] = y;
idx = pos;
while (idx > 1 && a[idx - 1] > a[idx])
{
std::swap(a[idx - 1], a[idx]);
idx--;
}
while (idx < n && a[idx + 1] < a[idx])
{
std::swap(a[idx], a[idx + 1]);
idx++;
}
std::sort(a + 1, a + 1 + n);
int coveredTo = -1, ans = 0;
for (int i = 1 ; i <= n ; ++i)
{
if (coveredTo < a[i])
{
ans++;
coveredTo = a[i] + len;
}
}
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... |