Submission #1240227

#TimeUsernameProblemLanguageResultExecution timeMemory
1240227GabrielDancing Elephants (IOI11_elephants)C++20
0 / 100
0 ms320 KiB
#include "elephants.h"
#include "bits/stdc++.h"
using namespace std;
int n, l;
vector<int> a;
void init(int N, int L, int X[]){
  n = N;
  l = L;
  for(int i = 0; i < n; i++) a.push_back(X[i]);
}
int update(int i, int y){
  a[i] = y;
  sort(a.begin(), a.end());
  int r = 0, p = -2;
  for(int i = 0; i < n; i++){
    if(p == -2){
      r++;
      p = a[i];
    } else if(a[i] > p + l){
      r++;
      p = a[i];
    }
  }
  return r;
}
#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...