Submission #345724

#	Time	Username	Problem	Language	Result	Execution time	Memory
345724		daniel920712	Dancing Elephants (IOI11_elephants)	C++14	26 / 100	9049 ms	2540 KiB

elephants

#include "elephants.h"
#include <map>
#include <algorithm>

using namespace std;
int n;
int all[150005];
map < int , int > con;
int l;
void init(int N, int l, int X[])
{
    int i;
    n = N;
    ::l=l;
    for(i=0;i<N;i++)
    {

        all[i]=X[i];
        con[X[i]]++;
    }
}

int update(int i, int y)
{
    int now=0;
    con[all[i]]--;
    if(con[all[i]]==0) con.erase(all[i]);
    con[y]++;
    all[i]=y;
    auto t=con.begin();
    while(t!=con.end())
    {
        now++;
        t=con.upper_bound(t->first+l);
    }
    return now;
}

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