Submission #807326

#	Time	Username	Problem	Language	Result	Execution time	Memory
807326		TheSahib	Dancing Elephants (IOI11_elephants)	C++14	26 / 100	9065 ms	2440 KiB

elephants

#pragma GCC optimize("O3")
#include "elephants.h"
#include <bits/stdc++.h>

using namespace std;

int n, l;
multiset<int> st; 
int arr[150005];

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

int update(int i, int y)
{
    st.erase(st.find(arr[i]));
    arr[i] = y;
    st.insert(arr[i]);
    int ans = 0;
    auto itr = st.begin();
    while(true){
        ans += 1;
        int a = *itr;
        itr = st.upper_bound(a + l);
        if(itr == st.end()) break;
    }
    return ans;
}

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