Submission #1345825

#	Time	Username	Problem	Language	Result	Execution time	Memory
1345825		SabaKharebava	Dancing Elephants (IOI11_elephants)	C++20	26 / 100	9089 ms	1556 KiB

elephants

#include<bits/stdc++.h>

using namespace std;

int n, l, x[150001];
set<int> st;

void init(int N, int L, int X[]) {
    n = N;
    l = L;
    for (int i = 0; i < n; i++) {
        st.insert(X[i]);
        x[i] = X[i];
    }
}

int update(int i, int y) {
    st.erase(x[i]);
    x[i] = y;
    st.insert(y);

    auto it = st.begin();
    int cnt = 0;
    while (true) {
        cnt++;
        auto next = upper_bound(it, st.end(), (int)(*it) + l);
        if (next == st.end())
            break;
        it = next;
    }

    return cnt;
}

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