5MLE.

2023206/main.cpp

@@ -1,5 +1,5 @@
 #include <stdio.h>
-#define TREE_SIZE 50000
+#define TREE_SIZE 65536
 struct TreeNode {
     int val;
     int size;
@@ -11,9 +11,10 @@ TreeNode tree[TREE_SIZE] = {0};
 int num_in_tree[TREE_SIZE] = {0};
 int num_in_tree_head = 0, num_in_tree_tail = 0;
 int tree_root = -1;
-int new_tree_node = 0;
+// int new_tree_node = 0;
 int M, K, H;
 long long total = 0;
+int l = 0;
 
 int enqueue(int num) {
     num_in_tree[num_in_tree_tail] = num;
@@ -30,17 +31,17 @@ int dequeue() {
 int insert_node(int num, int pos) {
     if (pos < 0) {
         // The tree_root is -1!
-        tree[new_tree_node] = TreeNode{num, 1, -1, -1};
-        tree_root = new_tree_node;
-        new_tree_node = (new_tree_node + 1) % TREE_SIZE;
+        tree[l % K] = TreeNode{num, 1, -1, -1};
+        tree_root = l % K;
+        // new_tree_node = (new_tree_node + 1) % TREE_SIZE;
         return 0;
     }
     tree[pos].size++;
     if (tree[pos].val > num) {
         if (tree[pos].left < 0) {
-            tree[pos].left = new_tree_node;
-            tree[new_tree_node] = TreeNode{num, 1, -1, -1};
-            new_tree_node = (new_tree_node + 1) % TREE_SIZE;
+            tree[pos].left = l % K;
+            tree[l % K] = TreeNode{num, 1, -1, -1};
+            // new_tree_node = (new_tree_node + 1) % TREE_SIZE;
             return 0;
         }
         else {
@@ -50,9 +51,9 @@ int insert_node(int num, int pos) {
     }
     else {
         if (tree[pos].right < 0) {
-            tree[pos].right = new_tree_node;
-            tree[new_tree_node] = TreeNode{num, 1, -1, -1};
-            new_tree_node = (new_tree_node + 1) % TREE_SIZE;
+            tree[pos].right = l % K;
+            tree[l % K] = TreeNode{num, 1, -1, -1};
+            // new_tree_node = (new_tree_node + 1) % TREE_SIZE;
             return 0;
         }
         else {
@@ -108,28 +109,35 @@ int delete_node(int num, int pos) {
         tree[parent].left = tree[child].right;
     }
 
-    tree[pos].val = tree[child].val;
-    return pos;
+    // tree[pos].val = tree[child].val;
+    // return pos;
+    tree[child].left = tree[pos].left;
+    tree[child].right = tree[pos].right;
+    tree[child].size = tree[pos].size;
+    return child;
 }
 
 int traverse(int pos) {
-    // printf("%d %d(", tree[pos].val, tree[pos].size);
-    // printf("%d(", tree[pos].val);
-    // if (tree[pos].left >= 0) {
-    //     printf("l%d:", tree[pos].val);
-    //     traverse(tree[pos].left);
-    // }
-    // if (tree[pos].right >= 0) {
-    //     printf("r%d:", tree[pos].val);
-    //     traverse(tree[pos].right);
-    // }
-    // printf(")");
     if (pos < 0) {
         return 0;
     }
-    traverse(tree[pos].left);
-    printf("%d ", tree[pos].val);
-    traverse(tree[pos].right);
+    printf("%d(", tree[pos].val);
+    if (tree[pos].left >= 0) {
+        printf("l%d:", tree[pos].val);
+        traverse(tree[pos].left);
+    }
+    if (tree[pos].right >= 0) {
+        printf("r%d:", tree[pos].val);
+        traverse(tree[pos].right);
+    }
+    printf(")");
+    fflush(stdout);
+    // if (pos < 0) {
+    //     return 0;
+    // }
+    // traverse(tree[pos].left);
+    // printf("%d ", tree[pos].val);
+    // traverse(tree[pos].right);
     return 0;
 }
 
@@ -160,23 +168,27 @@ int main() {
     scanf("%d %d %d", &M, &K, &H);
     int num = 0;
 
-    for (int i = 0; i < M; i++) {
+    for (l = 0; l < M; l++) {
         scanf("%d", &num);
 
-        // traverse(tree_root);
-        // printf("\n");
+        
         // printf("num: %d, %d %d\n\n", num, count_less_than(num + H, tree_root),
-        // if (i) {
-        //     total += count_less_than(num + H, tree_root) - count_less_than(num - H - 1,
-        //     tree_root);
-        // }
+
+        // printf("num: %d, %d %d\n", num, count_less_than(((long long)num) + H, tree_root), count_less_than(num - H - 1, tree_root));
+        // printf("num: %d, ", num);
+        // printf("%d ", count_less_than(((long long)num) + H, tree_root));
+        // printf("%d\n", count_less_than(num - H - 1, tree_root));
 
         total += count_less_than(((long long)num) + H, tree_root) - count_less_than(num - H - 1, tree_root);
-        if (i >= K) {
+        if (l >= K) {
             tree_root = delete_node(dequeue(), tree_root);
+            // traverse(tree_root);
+            // printf("\n");
         }
         enqueue(num);
         insert_node(num, tree_root);
+        // traverse(tree_root);
+        // printf("\n");
     }
 
     printf("%lld\n", total);

2023206/rand_input.py

@@ -1,12 +1,13 @@
 import random
 import os
-M = random.randint(10000, 100000)
-K = random.randint(10000, 100000)
-H = random.randint(10000, 100000)
-# M = 10000
-# K = 1
-# H = 1
-arr = list(range(2147483647, 2147483647 - M, -1))
+# M = random.randint(10000, 100000)
+# K = random.randint(10000, 65536)
+# H = random.randint(10000, 100000)
+M = 10
+K = 5
+H = 1
+# arr = list(range(2147483647, 2147483647 - M, -1))
+arr = list(range(0, M))
 random.shuffle(arr)
 # print(arr)
 with open('fuck.txt', 'w') as f:

2023206/testdata.txt

@@ -14,4 +14,15 @@ ans: 14
 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1
 
 15 20 2
-15 14 13 12 11 10 9 8 7 6 5 4 3 2 1
+15 14 13 12 11 10 9 8 7 6 5 4 3 2 1
+
+10 5 1
+2147483639 2147483647 2147483641 2147483645 2147483643 2147483640 2147483642 2147483638 2147483644 2147483646
+
+10 5 1
+2 10 4 8 6 3 5 1 7 9 
+
+10 5 1
+5 3 6 7 4 1 9 2 0 8 
+
+10 5 1 5 3 6 7 4 1 9 2 0 8 

fuck.txt

@@ -0,0 +1,2 @@
+10 5 1
+2147483640 2147483646 2147483644 2147483639 2147483643 2147483647 2147483641 2147483638 2147483645 2147483642