Submission #764354

#	Time	Username	Problem	Language	Result	Execution time	Memory
764354		boris_mihov	Dancing Elephants (IOI11_elephants)	C++17	26 / 100	9040 ms	1972 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];
int x[MAXN];
std::multiset <int> ms;
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];
        ms.insert(X[i]);
    }
}

int update(int idx, int y)
{
    idx++;
    ms.erase(ms.find(x[idx]));
    x[idx] = y;
    ms.insert(y);

    int coveredTo = -1, ans = 0;
    while (true)
    {
        auto it = ms.upper_bound(coveredTo);
        if (it == ms.end())
        {
            break;
        }

        ans++;
        coveredTo = (*it) + len; 
    }

    return ans;
}

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