Submission #607412

#TimeUsernameProblemLanguageResultExecution timeMemory
607412gonzakia29Dancing Elephants (IOI11_elephants)C++17
0 / 100
1 ms212 KiB
#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 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...