Submission #931461

#	Time	Username	Problem	Language	Result	Execution time	Memory
931461		mohammedMonem	Dancing Elephants (IOI11_elephants)	C++14	26 / 100	9039 ms	10160 KiB

elephants

#include "elephants.h"
#include <bits/stdc++.h>

using namespace std;

int n, l;
vector<int> x;
multiset<int> poss;

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

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

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