Submission #97203

#	Time	Username	Problem	Language	Result	Execution time	Memory
97203		Alexa2001	Dancing Elephants (IOI11_elephants)	C++17	26 / 100	9021 ms	2552 KiB

elephants

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

using namespace std;

const int Nmax = 1e5 + 5;

int n, L, where[Nmax];
multiset<int> S;

void init(int N, int _L, int X[])
{
    int i; n = N; L = _L;
    for(i=0; i<n; ++i)
    {
        where[i] = X[i];
        S.insert(X[i]);
    }
}

int update(int id, int y)
{
    S.erase(S.find(where[id]));
    S.insert(y); where[id] = y;

    int ans = 0;
    multiset<int> :: iterator 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