Submission #1241662

#	Time	Username	Problem	Language	Result	Execution time	Memory
1241662		adriines06	Dancing Elephants (IOI11_elephants)	C++20	50 / 100	9091 ms	1620 KiB

elephants

#include "elephants.h"
#include<bits/stdc++.h>
using namespace std;
int n,l;
vector<int>v,p;
void init(int N, int L, int X[])
{
  n = N,l=L;
  v.resize(n);
  p.resize(n);
  for(int i=0;i<n;i++){
    v[i]=X[i];
    p[i]=X[i];
  }
  sort(p.begin(),p.end());
}

int update(int i, int y)
{
  if(n==1) return 1;
  auto it1=lower_bound(p.begin(),p.end(),v[i]);
  p.erase(it1);
  v[i]=y;
  auto it=lower_bound(p.begin(),p.end(),y);
  if(it==p.end()) p.push_back(y);
  else p.insert(it,y);

  int cont=1, ant=p[0];
  for(int k=1;k<n;k++){
    if(ant+l<p[k]){
      cont++;
      ant=p[k];
    }
  }

  return cont;
}

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