-
-
Notifications
You must be signed in to change notification settings - Fork 47
/
Copy pathheap.cy
215 lines (186 loc) · 5.98 KB
/
heap.cy
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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
use os
var start = os.now()
type Node:
left dyn
right dyn
parent dyn
value dyn
func getLeftmost(self) dyn:
if self.left == false:
return self
return self.left.getLeftmost()
func getRightmost(self) dyn:
if self.right == false:
return self
return self.right.getRightmost()
func getLeftSibling(self) dyn:
if self.parent.right == self:
return self.parent.left
else:
return self.parent.getLeftSibling2(1)
func getLeftSibling2(self, height int) dyn:
if self.parent.right == self:
return self.parent.left.getRightN(height)
else:
return self.parent.getLeftSibling2(height + 1)
func getRightSibling(self) dyn:
if self.parent.left == self:
return self.parent.right
else:
return self.parent.getRightSibling2(1)
func getRightSibling2(self, height int) dyn:
if self.parent.left == self:
return self.parent.right.getLeftN(height)
else:
return self.parent.getRightSibling2(height + 1)
func getRightN(self, n int) dyn:
if n == 1:
return self.right
else:
return self.right.getRightN(n - 1)
func getLeftN(self, n int) dyn:
if n == 1:
return self.left
else:
return self.left.getLeftN(n - 1)
func Heap.new() Heap:
return Heap{root=false, size=0, last=false}
type Heap:
root dyn
size dyn
last dyn
func insert(self, value int):
if self.root == false:
self.root = Node{left=false, right=false, parent=false, value=value}
self.last = self.root
self.size = 1
return
dyn new = false
if int(self.size + 1) & int(self.size) == 0:
-- Insert at left most node.
dyn parent = self.root.getLeftmost()
new = Node{
left = false,
right = false,
parent = parent,
value = value,
}
parent.left = new
self.last = new
else:
-- Insert after last node.
if self.size % 2 == 0:
new = Node{
left = false,
right = false,
parent = self.last.parent,
value = value,
}
self.last.parent.right = new
self.last = new
else:
dyn sibling = self.last.parent.getRightSibling()
new = Node{
left = false,
right = false,
parent = sibling,
value = value,
}
sibling.left = new
self.last = new
self.size = self.size + 1
self.siftUp(new)
func swapUp(self, node Node):
if self.last == node:
self.last = node.parent
dyn parentSave = node.parent
dyn parentLeft = parentSave.left
dyn parentRight = parentSave.right
dyn parentParent = parentSave.parent
parentSave.left = node.left
if node.left != false:
node.left.parent = parentSave
parentSave.right = node.right
if node.right != false:
node.right.parent = parentSave
parentSave.parent = node
if parentLeft == node:
node.left = parentSave
node.right = parentRight
if parentRight != false:
parentRight.parent = node
else:
node.left = parentLeft
node.right = parentSave
if parentLeft != false:
parentLeft.parent = node
node.parent = parentParent
if parentParent == false:
self.root = node
else:
if parentParent.left == parentSave:
parentParent.left = node
else:
parentParent.right = node
func siftUp(self, node Node):
if node.parent == false:
return
if node.value > node.parent.value:
self.swapUp(node)
if self.root != node:
self.siftUp(node)
func siftDown(self, node Node):
if node.left != false and node.left.value > node.value:
self.swapUp(node.left)
self.siftDown(node)
else node.right != false and node.right.value > node.value:
self.swapUp(node.right)
self.siftDown(node)
func popTop(self) Node:
if self.size == 1:
var res = self.root
self.root = false
self.last = false
self.size = 0
return res
if self.size <= 3:
dyn top = self.root
self.swapUp(self.last)
top.parent = false
if self.size == 3:
self.root.right = false
self.last = self.root.left
else:
self.root.left = false
self.last = self.root
self.size = self.size - 1
return top
dyn newLast = false
if int(self.size) & int(self.size - 1) == 0:
newLast = self.root.getRightmost()
else:
newLast = self.last.getLeftSibling()
-- Move last to top and remove last.
self.root.left.parent = self.last
self.last.left = self.root.left
self.root.right.parent = self.last
self.last.right = self.root.right
if self.last.parent.left == self.last:
self.last.parent.left = false
else:
self.last.parent.right = false
self.last.parent = false
var top = self.root
self.root = self.last
self.last = newLast
self.size = self.size - 1
self.siftDown(self.root)
return top
var h = Heap.new()
for 1..20000 -> i:
h.insert(i)
var sum = 0
for 1..20000 -> i:
sum = sum + h.popTop().value
print("time: $((os.now() - start) * 1000)")
print(sum)