Submission #254738

#	Time	Username	Problem	Language	Result	Execution time	Memory
254738		Sorting	Dancing Elephants (IOI11_elephants)	C++14	0 / 100	0 ms	384 KiB

elephants

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

using namespace std;

const int k_N = 15e4 + 3;

int n, l;
int *x;

multiset<int> s;

void init(int N, int L, int X[]){
    n = N;
    l = L;
    x = X;
}

int update(int idx, int y){
    s.erase(x[idx]);
    x[idx] = y;
    s.insert(x[idx]);

    int start = *s.begin(), ans = 1;
    for(int u: s){
        if(u - start > l){
            start = u;
            ans++;
        }
    }

    return ans;
}

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