Submission #764333

#	Time	Username	Problem	Language	Result	Execution time	Memory
764333		boris_mihov	Dancing Elephants (IOI11_elephants)	C++17	0 / 100	0 ms	340 KiB

elephants

#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];
void init(int N, int L, int X[])
{
    n = N;
    len = L;
    for (int i = 0 ; i < n ; ++i)
    {
        a[i + 1] = X[i];
    }
}

int update(int idx, int y)
{
    idx++;
    a[idx] = y;
    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++;
    }

    int coveredTo = -1, ans = 0;
    for (int i = 1 ; i <= n ; ++i)
    {
        if (coveredTo < a[i])
        {
            ans++;
            coveredTo = a[i] + len;
        }
    }

    return ans;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 16
• Subtask 3: 0 / 24
• Subtask 4: 0 / 47
• Subtask 5: 0 / 3