Submission #946645

#	Time	Username	Problem	Language	Result	Execution time	Memory
946645		OAleksa	Dancing Elephants (IOI11_elephants)	C++14	26 / 100	9051 ms	9044 KiB

elephants

#include "elephants.h"
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
const int N = 150069;
int n, a[N], d;

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

int update(int j, int y) {
   vector<int> x;
   a[j] = y;
   for (int i = 0;i < n;i++)
      x.push_back(a[i]);
   sort(x.begin(), x.end());
   int ans = 0;
   int i = 0, lst = -1;
   while (i < n) {
      if (i > lst) {
         ++ans;
         lst = upper_bound(x.begin(), x.end(), x[i] + d) - x.begin() - 1;
      }
      else
         ++i;
   }
   return ans;
}

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