unlockable/DataStructureAndAlgorithm
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

5MLE.

Browse Source
This commit is contained in:
unlockable
2023-11-29 20:39:02 +08:00
parent 3b252c7cd0
commit dc0662635f
5 changed files with 71 additions and 45 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
2023206/fuck.txt
View File

File diff suppressed because one or more lines are too long

82
2023206/main.cpp
View File

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

15
2023206/rand_input.py
View File

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

13
2023206/testdata.txt
View File

@@ -14,4 +14,15 @@ ans: 14
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
15 20 2 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

2
fuck.txt Normal file
View File

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