Try short

2023206/main.cpp

@@ -1,16 +1,17 @@
 #include <stdio.h>
-#define TREE_SIZE 50000
+#define TREE_SIZE 65535
+#define NOTHING 65535
 struct TreeNode {
     int val;
     int size;
-    int left;
-    int right;
+    unsigned short left;
+    unsigned short right;
 };
 
 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 tree_root = NOTHING;
 int new_tree_node = 0;
 int M, K, H;
 long long total = 0;
@@ -28,18 +29,18 @@ int dequeue() {
 }
 
 int insert_node(int num, int pos) {
-    if (pos < 0) {
+    if (pos >= NOTHING) {
         // The tree_root is -1!
-        tree[new_tree_node] = TreeNode{num, 1, -1, -1};
+        tree[new_tree_node] = TreeNode{num, 1, NOTHING, NOTHING};
         tree_root = new_tree_node;
         new_tree_node = (new_tree_node + 1) % TREE_SIZE;
         return 0;
     }
     tree[pos].size++;
     if (tree[pos].val > num) {
-        if (tree[pos].left < 0) {
+        if (tree[pos].left >= NOTHING) {
             tree[pos].left = new_tree_node;
-            tree[new_tree_node] = TreeNode{num, 1, -1, -1};
+            tree[new_tree_node] = TreeNode{num, 1, NOTHING, NOTHING};
             new_tree_node = (new_tree_node + 1) % TREE_SIZE;
             return 0;
         }
@@ -49,9 +50,9 @@ int insert_node(int num, int pos) {
         }
     }
     else {
-        if (tree[pos].right < 0) {
+        if (tree[pos].right >= NOTHING ) {
             tree[pos].right = new_tree_node;
-            tree[new_tree_node] = TreeNode{num, 1, -1, -1};
+            tree[new_tree_node] = TreeNode{num, 1, NOTHING, NOTHING};
             new_tree_node = (new_tree_node + 1) % TREE_SIZE;
             return 0;
         }
@@ -63,7 +64,7 @@ int insert_node(int num, int pos) {
 }
 
 int delete_node(int num, int pos) {
-    if (pos < 0) {
+    if (pos >= NOTHING) {
         return -1;
     }
 
@@ -80,13 +81,13 @@ int delete_node(int num, int pos) {
     }
 
     // If reached here, tree[pos].val == num, so we are going to delete tree[pos]
-    if (tree[pos].left < 0) {
+    if (tree[pos].left >= NOTHING) {
         // The case when left is null, right is something
         // and also the case when both left and right is null
         return tree[pos].right;
     }
 
-    if (tree[pos].right < 0) {
+    if (tree[pos].right >= NOTHING) {
         // The case when left is something while right is null
         return tree[pos].left;
     }
@@ -95,8 +96,8 @@ int delete_node(int num, int pos) {
     int parent = pos;
     int child = tree[parent].right;
     tree[parent].size--;
-    while (tree[child].left >= 0) {
-        parent = child;
+    while (tree[child].left < NOTHING) {
+        parent = child; 
         child = tree[child].left;
         tree[parent].size--;
     }
@@ -134,12 +135,12 @@ int traverse(int pos) {
 }
 
 int count_less_than(long long target, int pos) {
-    if (pos < 0) {
+    if (pos >= NOTHING) {
         return 0;
     }
 
     if (tree[pos].val < target) {
-        if (tree[pos].left < 0) {
+        if (tree[pos].left >= NOTHING) {
             return 1 + count_less_than(target, tree[pos].right);
         }
         return tree[tree[pos].left].size + 1 + count_less_than(target, tree[pos].right);
@@ -150,7 +151,7 @@ int count_less_than(long long target, int pos) {
 
     // tree[pos].val == target
 
-    if (tree[pos].left < 0) {
+    if (tree[pos].left >= NOTHING) {
         return 1;
     }
     return 1 + tree[tree[pos].left].size;

2023206/rand_input.py

@@ -1,16 +1,19 @@
 import random
 import os
-M = random.randint(10000, 100000)
-K = random.randint(10000, 100000)
-H = random.randint(10000, 100000)
+m = random.randint(10000, 100000)
+k = random.randint(10000, 65535)
+h = random.randint(10000, 100000)
 # M = 10000
 # K = 1
 # H = 1
-arr = list(range(2147483647, 2147483647 - M, -1))
+arr = list(range(2147483647, 2147483647 - m, -1))
+# print(len(arr) == M)
+arr.append(0)
+m += 1
 random.shuffle(arr)
 # print(arr)
 with open('fuck.txt', 'w') as f:
-    f.write(str(M)+' '+str(K)+' '+str(H)+'\n')
+    f.write(str(m)+' '+str(k)+' '+str(h)+'\n')
     for i in arr:
         f.write(str(i)+' ')
     f.write('\n')