Submission #850478

#TimeUsernameProblemLanguageResultExecution timeMemory
850478HunterXDDancing Elephants (IOI11_elephants)C++17
26 / 100
9056 ms9308 KiB
#include "elephants.h"

#include <set>

using namespace std;

int n, l;
int a[50010];
set<int> ms;

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

int update(int i, int y) {
  ms.erase(a[i]), a[i] = y, ms.insert(y);
  int sig = *ms.begin() + l, counter = 1;
  for (auto v : ms)
    if (v > sig) counter++, sig = v + l;
  return counter;
}
#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...