Submission #623616

#	Time	Username	Problem	Language	Result	Execution time	Memory
623616		lorenzoferrari	Dancing Elephants (IOI11_elephants)	C++17	26 / 100	9006 ms	2396 KiB

elephants

#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 150000;

int n, l, x[MAXN];
multiset<int> s;

void init(int nn, int ll, int xx[]) {
    n = nn, l = ll;
    for (int i = 0; i < n; ++i) {
        x[i] = xx[i];
        s.insert(x[i]);
    }
}

int update(int i, int y) {
    s.erase(s.find(x[i]));
    x[i] = y;
    s.insert(x[i]);;
    int ans = 0;
    auto it = s.begin();
    while (it != s.end()) {
        it = s.upper_bound(*it + l);
        ++ans;
    }
    return ans;
}

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