Submission #781653

#	Time	Username	Problem	Language	Result	Execution time	Memory
781653		Dakto	Dancing Elephants (IOI11_elephants)	C++17	0 / 100	0 ms	212 KiB

elephants

#include <bits/stdc++.h>

using namespace std;

#include "elephants.h"

int n;
int l;

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

void init(int N, int L, int X[])
{
  n = N;
  l=L;
  ind.resize(n);
  v2.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)
{
    int erind=(lower_bound(v.begin(), v.end(), ind[i]))-v.begin();
    int insind=upper_bound(v.begin(), v.end(), y)-v.begin();
    int shift=0;
    int res=0;

    long long last=-100000000;
    for(int j=0; j<n; j++){
        if(j==insind){
            v2[j+shift]=y;
            shift+=1;
            if(y>last){
                last=y+l;
                res++;
            }
        }
        if(j==erind){
            shift-=1;
            continue;
        }
        v2[j+shift]=v[j];
        if(j==n-1 && shift==-1) v2[n-1]=y;
        auto&x =v2[shift+j];
        if(x>last){
            last=x+l;
            res++;
        }

    }
    swap(v,v2);
    ind[i]=y;
    return res;
}

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