Submission #781665

#	Time	Username	Problem	Language	Result	Execution time	Memory
781665		Dakto	Dancing Elephants (IOI11_elephants)	C++17	0 / 100	1 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;
list<int> ls;

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());
  for(auto i:v) ls.push_back(i);
}

int update(int j, int y)
{
    bool er=1;
    bool ins=1;
    for(auto i=ls.begin(); i!=ls.end(); i++){
        if(ins && *i>=y){
            ls.insert(i, y);
            ins=0;
        }
        if(er&& *i==ind[j]){
            i=ls.erase(i);
            er=0;
        }
    }
    if(ins) ls.push_back(y);
    ind[j]=y;
    int res=0;
    int mx=-10000000;
    for(auto i:ls){
        if(i>mx){
            mx=i+l;
            res++;
        }
    }
    return res;
}

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