Submission #411281

#	Time	Username	Problem	Language	Result	Execution time	Memory
411281		LouayFarah	Dancing Elephants (IOI11_elephants)	C++14	26 / 100	9087 ms	1808 KiB

elephants

#include "bits/stdc++.h"
#include "elephants.h"
using namespace std;

int n, l;
int *x;
vector<int> pos;
vector<int> ele;

void init(int N, int L, int X[])
{
    n = N;
    l = L;
    x = X;
    pos.resize(n);
    ele.resize(n);
    for(int i = 0; i<n; i++)
    {
        pos[i] = i;
        ele[i] = x[i];
    }

}

int solve()
{
    int len = x[0];
    len+=l;
    int res = 1;
    int j = 1;
    while(j<n)
    {
        while(j<n&&x[j]<=len)
            j++;
        res++;
        len = x[j]+l;
    }

    return res-1;
}

int update(int i, int y)
{
    int ind = lower_bound(x, x+n, ele[i]) - x;
    x[ind] = y;
    ele[i] = y;
    sort(x, x+n);
    int res = solve();
    return res;
}

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