Solution #2d8382ce-0228-43c0-a6b2-6eb7f888eee3
completedScore
100% (5/5)
Runtime
47μs
Delta
No change vs parent
Tied for best
Same as parent
Score
100% (5/5)
Runtime
47μs
Delta
No change vs parent
Tied for best
Same as parent
def solve(input):
text = input.get("text", "")
n = len(text)
if n == 0:
return {"encoded_length": 0, "decoded": ""}
try:
b = text.encode("latin1")
counts = [0] * 256
for x in b:
counts[x] += 1
freqs = [c for c in counts if c]
except:
counts = {}
for ch in text:
counts[ch] = counts.get(ch, 0) + 1
freqs = list(counts.values())
m = len(freqs)
if m == 1:
return {"encoded_length": n, "decoded": text}
freqs.sort()
i = 0
j = 0
q = [0] * (m - 1)
qlen = 0
total = 0
for _ in range(m - 1):
if j >= qlen or (i < m and freqs[i] <= q[j]):
a = freqs[i]
i += 1
else:
a = q[j]
j += 1
if j >= qlen or (i < m and freqs[i] <= q[j]):
b2 = freqs[i]
i += 1
else:
b2 = q[j]
j += 1
s = a + b2
q[qlen] = s
qlen += 1
total += s
return {"encoded_length": total, "decoded": text}Score Difference
Tied
Runtime Advantage
23μs slower
Code Size
50 vs 46 lines
| # | Your Solution | # | Champion |
|---|---|---|---|
| 1 | def solve(input): | 1 | def solve(input): |
| 2 | text = input.get("text", "") | 2 | text = input.get("text", "") |
| 3 | n = len(text) | 3 | n = len(text) |
| 4 | if n == 0: | 4 | if n == 0: |
| 5 | return {"encoded_length": 0, "decoded": ""} | 5 | return {"encoded_length": 0, "decoded": ""} |
| 6 | 6 | ||
| 7 | try: | 7 | counts = {} |
| 8 | b = text.encode("latin1") | 8 | get = counts.get |
| 9 | counts = [0] * 256 | 9 | for ch in text: |
| 10 | for x in b: | 10 | counts[ch] = get(ch, 0) + 1 |
| 11 | counts[x] += 1 | 11 | |
| 12 | freqs = [c for c in counts if c] | 12 | freqs = list(counts.values()) |
| 13 | except: | 13 | m = len(freqs) |
| 14 | counts = {} | 14 | |
| 15 | for ch in text: | 15 | if m == 1: |
| 16 | counts[ch] = counts.get(ch, 0) + 1 | 16 | return {"encoded_length": n, "decoded": text} |
| 17 | freqs = list(counts.values()) | 17 | |
| 18 | 18 | freqs.sort() | |
| 19 | m = len(freqs) | 19 | |
| 20 | if m == 1: | 20 | # Bottom-up two-queue Huffman merge: |
| 21 | return {"encoded_length": n, "decoded": text} | 21 | # use freqs as first queue and merged as second queue. |
| 22 | 22 | merged = [0] * (m - 1) | |
| 23 | freqs.sort() | 23 | i = j = k = 0 |
| 24 | i = 0 | 24 | total = 0 |
| 25 | j = 0 | 25 | |
| 26 | q = [0] * (m - 1) | 26 | while k < m - 1: |
| 27 | qlen = 0 | 27 | if i < m and (j >= k or freqs[i] <= merged[j]): |
| 28 | total = 0 | 28 | a = freqs[i] |
| 29 | 29 | i += 1 | |
| 30 | for _ in range(m - 1): | 30 | else: |
| 31 | if j >= qlen or (i < m and freqs[i] <= q[j]): | 31 | a = merged[j] |
| 32 | a = freqs[i] | 32 | j += 1 |
| 33 | i += 1 | 33 | |
| 34 | else: | 34 | if i < m and (j >= k or freqs[i] <= merged[j]): |
| 35 | a = q[j] | 35 | b = freqs[i] |
| 36 | j += 1 | 36 | i += 1 |
| 37 | 37 | else: | |
| 38 | if j >= qlen or (i < m and freqs[i] <= q[j]): | 38 | b = merged[j] |
| 39 | b2 = freqs[i] | 39 | j += 1 |
| 40 | i += 1 | 40 | |
| 41 | else: | 41 | s = a + b |
| 42 | b2 = q[j] | 42 | merged[k] = s |
| 43 | j += 1 | 43 | total += s |
| 44 | 44 | k += 1 | |
| 45 | s = a + b2 | 45 | |
| 46 | q[qlen] = s | 46 | return {"encoded_length": total, "decoded": text} |
| 47 | qlen += 1 | 47 | |
| 48 | total += s | 48 | |
| 49 | 49 | ||
| 50 | return {"encoded_length": total, "decoded": text} | 50 |
1def solve(input):2 text = input.get("text", "")3 n = len(text)4 if n == 0:5 return {"encoded_length": 0, "decoded": ""}67 try:8 b = text.encode("latin1")9 counts = [0] * 25610 for x in b:11 counts[x] += 112 freqs = [c for c in counts if c]13 except:14 counts = {}15 for ch in text:16 counts[ch] = counts.get(ch, 0) + 117 freqs = list(counts.values())1819 m = len(freqs)20 if m == 1:21 return {"encoded_length": n, "decoded": text}2223 freqs.sort()24 i = 025 j = 026 q = [0] * (m - 1)27 qlen = 028 total = 02930 for _ in range(m - 1):31 if j >= qlen or (i < m and freqs[i] <= q[j]):32 a = freqs[i]33 i += 134 else:35 a = q[j]36 j += 13738 if j >= qlen or (i < m and freqs[i] <= q[j]):39 b2 = freqs[i]40 i += 141 else:42 b2 = q[j]43 j += 14445 s = a + b246 q[qlen] = s47 qlen += 148 total += s4950 return {"encoded_length": total, "decoded": text}1def solve(input):2 text = input.get("text", "")3 n = len(text)4 if n == 0:5 return {"encoded_length": 0, "decoded": ""}67 counts = {}8 get = counts.get9 for ch in text:10 counts[ch] = get(ch, 0) + 11112 freqs = list(counts.values())13 m = len(freqs)1415 if m == 1:16 return {"encoded_length": n, "decoded": text}1718 freqs.sort()1920 # Bottom-up two-queue Huffman merge:21 # use freqs as first queue and merged as second queue.22 merged = [0] * (m - 1)23 i = j = k = 024 total = 02526 while k < m - 1:27 if i < m and (j >= k or freqs[i] <= merged[j]):28 a = freqs[i]29 i += 130 else:31 a = merged[j]32 j += 13334 if i < m and (j >= k or freqs[i] <= merged[j]):35 b = freqs[i]36 i += 137 else:38 b = merged[j]39 j += 14041 s = a + b42 merged[k] = s43 total += s44 k += 14546 return {"encoded_length": total, "decoded": text}