This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "elephants.h"
#include <iostream>
using namespace std;
int n;
int l;
long long x[150000];
void init(int N, int L, int X[]){
n = N;
l = L;
for (int i = 0; i < n; ++i){
x[i] = X[i];
}
}
int update(int i, int y){
x[i] = y;
if (x[2]-x[1] <= l){
return 1;
}
return n;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |