Submission #485365

#	Time	Username	Problem	Language	Result	Execution time	Memory
485365		blue	Dancing Elephants (IOI11_elephants)	C++17	10 / 100	0 ms	204 KiB

elephants

#include "elephants.h"
#include <vector>
#include <algorithm>
using namespace std;

const int maxN = 50'000;

int N;
int L;
int* X;
int* I;

void init(int N_, int L_, int X_[])
{
    N = N_;
    L = L_;
    X = new int[N];
    for(int i = 0; i < N; i++) X[i] = X_[i];
}

int update(int i, int y)
{
    X[i] = y;

    if(abs(X[0] - X[1]) > L) return 2;
    else return 1;
}

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