제출 #671767

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
671767		Hacv16	코끼리 (Dancing Elephants) (IOI11_elephants)	C++17	26 / 100	9091 ms	2908 KiB

elephants

#include "elephants.h"
#include<bits/stdc++.h>
 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,tune=native")
#define sz(x) (int) x.size()
#define all(x) x.begin(), x.end()
using namespace std;
const int MAX = 1e5 + 15;
 
int n, l, pos[MAX];
vector<int> x;
 
void init(int n_, int l_, int x_[]){
  n = n_, l = l_;
  x.resize(n);

  for(int i = 0; i < n; i++)
     x[i] = x_[i], pos[i] = x[i];
}

vector<int> Merge(vector<int>& x, vector<int>& y, vector<int>& z){
  vector<int> aux(sz(x) + sz(y)), ret(sz(x) + sz(y) + sz(z));

  merge(all(x), all(y), aux.begin());
  merge(all(aux), all(z), ret.begin());

  return ret;
}
 
int update(int i, int y){ 
  vector<int> a, b, c;

  int id = 0;
  while(x[id] < pos[i]) id++;

  for(int j = 0; j < id; j++)
    a.emplace_back(x[j]);

  for(int j = id + 1; j < n; j++)
    b.emplace_back(x[j]);

  c.emplace_back(y);

  vector<int> aux = Merge(a, b, c);
  swap(aux, x);

  int ans = 0, r = -1;
 
  for(int j = 0; j < n; j++) 
    if(x[j] > r) ans++, r = x[j] + l;
 
  pos[i] = y;

  return ans;
}

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