제출 #233947

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
233947	2020-05-22 13:03:39	crossing0ver	코끼리 (Dancing Elephants) (IOI11_elephants)	C++17	100 / 100	5124 ms	8316 KiB

elephants

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#include "elephants.h"
using namespace std;
const int K = 400, MXN = 1.5E5 + 5;
int P[150000], inbox[150000] , L,B, n,Q,sorted[150000]; 
struct BLOCK{
  int sz;
  int arr[K*2 + 10] , last[K*2 + 10], cost[K*2 + 10];
  
  void del(int x) {
    for (int i = 0; i < sz; i++)
      if (arr[i] == x) {
        x = i; break;
      }
    for (; x < sz;x++)
      swap(arr[x],arr[x+1]);
    sz--;
  }
  void insert (int x) {
    arr[sz] = x;
    int pos = sz;
    for ( ; pos > 0 && P[x] <  P[ arr[pos - 1] ]; pos--)
        swap(arr[pos],arr[pos - 1]);
    sz++;
  }
  void slv() {
    int ptr = sz - 1;
    for (int i = sz - 1; i >= 0; i--) {
      while (ptr > 0 && P[arr[i]] + L < P[arr[ptr - 1]]) ptr--;
      if (P[arr[i]] + L>= P[arr[sz - 1]]) 
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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