Submission #565563

#	Time	Username	Problem	Language	Result	Execution time	Memory
565563		qwerasdfzxcl	Dancing Elephants (IOI11_elephants)	C++14	26 / 100	9001 ms	1964 KiB

elephants

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

using namespace std;
typedef long long ll;
const int INF = 1e9+100;

int n, l, a[150150], b[150150];

void init(int N, int L, int X[])
{
    n = N, l = L;
    for (int i=0;i<N;i++) a[i+1] = X[i];
}

int update(int i, int y)
{
    i++;
    a[i] = y;
    for (int i=1;i<=n;i++) b[i] = a[i];
    sort(b+1, b+n+1);

    int s = -INF, ans = 0;
    for (int i=1;i<=n;i++){
        if (s+l < b[i]) ans++, s = b[i];
    }
    return ans;
}

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