Submission #1241677

#	Time	Username	Problem	Language	Result	Execution time	Memory
1241677		Gabriel	Dancing Elephants (IOI11_elephants)	C++20	10 / 100	0 ms	328 KiB

elephants

#include "elephants.h"
#include "bits/stdc++.h"
using namespace std;
int n, l;
vector<int> a;
unordered_map<int, int> Mapa;
void init(int N, int L, int X[]){
  n = N;
  l = L;
  for(int i = 0; i < n; i++){
    Mapa[i] = i;
    a.push_back(X[i]);
  }
}
int update(int i, int y){
  a[Mapa[i]] = y;
  for(int j = Mapa[i]; j > 0; j--){
    if(a[j] >= a[j - 1]) break;
    else {
      swap(a[j], a[j - 1]);
      swap(Mapa[j], Mapa[j - 1]);
    }
  }
  for(int j = Mapa[i]; j < n - 1; j++){
    if(a[j] <= a[j + 1]) break;
    else {
      swap(a[j], a[j + 1]);
      swap(Mapa[j], Mapa[j + 1]);
    }
  }
  int r = 0, p = -2;
  for(auto E: a){
    if(p == -2){
      r++;
      p = E;
    } else if(E > p + l){
      r++;
      p = E;
    }
  }
  return r;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 16
• Subtask 3: 0 / 24
• Subtask 4: 0 / 47
• Subtask 5: 0 / 3