Submission #254784

#	Time	Username	Problem	Language	Result	Execution time	Memory
254784		Sorting	Dancing Elephants (IOI11_elephants)	C++14	26 / 100	9078 ms	1784 KiB

elephants

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

#pragma GCC optimize("O3")
 
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;
 
    for(int i = 0; i < n; ++i)
        s.insert(x[i]);
}
 
int update(int idx, int y){
    s.erase(s.find(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: 10 / 10
• Subtask 2: 16 / 16
• Subtask 3: 0 / 24
• Subtask 4: 0 / 47
• Subtask 5: 0 / 3