Submission #13506

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
13506	2015-02-22 05:04:04	ainta	Dancing Elephants (IOI11_elephants)	C++98	100 / 100	4353 ms	21708 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 "elephants.h"
int n, w[151000], D, C[310], SZ, CC, Tw[151000];
struct BList{
  int x, d, pv;
}P[310][1050];
void UDT(int a){
  int i, pv = C[a] + 1;
  for (i = C[a]; i >= 1; i--){
    while (P[a][pv - 1].x - P[a][i].x > D)pv--;
    if (pv == C[a] + 1)P[a][i].d = 0, P[a][i].pv = i;
    else P[a][i].d = P[a][pv].d + 1, P[a][i].pv = P[a][pv].pv;
  }
}
void init(int N, int L, int X[])
{
  int i;
  n = N, D = L;
  for (i = 0; i < N; i++){
    w[i] = X[i];
    C[i >> 9]++;
    P[i >> 9][C[i >> 9]].x = w[i];
  }
  SZ = (N - 1) >> 9;
  for (i = 0; i <= SZ; i++)UDT(i);
}
void init2(){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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