Submission #1114847

#	Time	Username	Problem	Language	Result	Execution time	Memory
1114847		ortsac	Dancing Elephants (IOI11_elephants)	C++17	10 / 100	2 ms	6480 KiB

elephants

#pragma GCC optimize("O3")
#include "elephants.h"
#include <bits/stdc++.h>

using namespace std;

int n, l;
vector<int> v;
vector<int> po;
const int INF = (1e9 + 1);

void init(int N, int L, int X[])
{
  n = N;
  l = L;
  v.resize(n);
  po.resize(n);
  for (int i = 0; i < n; i++) {
    po[i] = i;
    v[i] = X[i];
  }
}

int update(int i, int y) {
  if (v[po[i]] < y) {
    v[po[i]] = y;
    int lst = -INF, qtd = 0;
    for (int i = 0; i < n; i++) {
      if ((i < (n - 1)) && (v[i] > v[i + 1])) {
        swap(v[i], v[i + 1]);
        swap(po[i], po[i + 1]);
      }
      if (v[i] > (lst + l)) {
        lst = v[i];
        qtd++;
      }
    }
    return qtd;
  } else {
    v[po[i]] = y;
    int lst = INF, qtd = 0;
    for (int i = n - 1; i >= 0; i--) {
      if ((i > 0) && (v[i] < v[i - 1])) {
        swap(v[i], v[i - 1]);
        swap(po[i], po[i - 1]);
      }
      if (v[i] < (lst - l)) {
        lst = v[i];
        qtd++;
      }
    }
    return qtd;
  }
}

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