제출 #607446

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
607446		APROHACK	Dancing Elephants (IOI11_elephants)	C++14	26 / 100	9058 ms	2540 KiB

elephants

#include "elephants.h"
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;
ll n;
ll mn, mx, l;
vector<pair<ll, ll> >a;
map<int, int> pos; // indx a is in indx b
void upd(){
  sort(a.begin(), a.end());
  for(int i = 0 ; i < n ; i ++){
    pos[a[i].ss] = i;
  }
}
void init(int N, int L, int X[])
{
  n = N, l = L;
  for(int i = 0 ; i < n ; i++){
    a.pb({X[i], i});
  }
  upd();
  
}

int update(int i, int y)
{
  a[pos[i]]={y, a[pos[i]].ss};
  upd();
  ll cuenta = 1, curr = a[0].ff;
  for(int i = 1 ; i < n ; i ++){
    if(curr+l >= a[i].ff)continue;
    cuenta++;
    curr = a[i].ff  ;
  }
  return cuenta;
}

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