Submission #1114835

#	Time	Username	Problem	Language	Result	Execution time	Memory
1114835		ortsac	코끼리 (Dancing Elephants) (IOI11_elephants)	C++17	26 / 100	9044 ms	12880 KiB

elephants

#include "elephants.h"
#include <bits/stdc++.h>

using namespace std;

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

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

int update(int i, int y) {
  s.erase(s.lower_bound(v[i]));
  s.insert(y);
  v[i] = y;
  int lst = -INF, qtd = 0;
  for (auto u : s) {
    if (u > (lst + l)) {
      qtd++;
      lst = u;
    }
  }
  return qtd;
}

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