Submission #781617

#TimeUsernameProblemLanguageResultExecution timeMemory
781617DaktoDancing Elephants (IOI11_elephants)C++17
50 / 100
9013 ms3660 KiB
#include <bits/stdc++.h>

using namespace std;

#include "elephants.h"

int n;
int l;

vector<int> v;
vector<int> ind;

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

int update(int i, int y)
{
    v.erase(lower_bound(v.begin(), v.end(), ind[i]));
    ind[i]=y;
    v.insert(lower_bound(v.begin(), v.end(), ind[i]), ind[i]);
    int res=0;

    long long last=-100000000;
    for(auto i:v){
        if(i>last){
            last=i+l;
            res++;
        }
    }
    return res;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...