Submission #931457

#TimeUsernameProblemLanguageResultExecution timeMemory
931457mohammedMonemDancing Elephants (IOI11_elephants)C++14
10 / 100
2 ms6492 KiB
#include "elephants.h"
#include <bits/stdc++.h>

using namespace std;

int n, l;
vector<int> x;

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

int update(int i, int y) {
    x[i] = y;
    return 1 + (abs(x[0] - x[1]) > l);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...