Solution #8f72c514-156a-4152-b2d9-ec74b3d53b19

1def solve(input):
2    text = input.get("text", "")
3    n = len(text)
4    if n == 0:
5        return {"encoded_length": 0, "decoded": ""}
6
7    def count_dc(s):
8        ln = len(s)
9        if ln <= 32:
10            d = {}
11            for ch in s:
12                d[ch] = d.get(ch, 0) + 1
13            return d
14        mid = ln >> 1
15        left = count_dc(s[:mid])
16        right = count_dc(s[mid:])
17        if len(left) < len(right):
18            left, right = right, left
19        for ch, c in right.items():
20            left[ch] = left.get(ch, 0) + c
21        return left
22
23    counts = count_dc(text)
24    vals = sorted(counts.values())
25    m = len(vals)
26
27    if m == 1:
28        return {"encoded_length": n, "decoded": text}
29
30    q = vals + [0] * (m - 1)
31    i = 0
32    j = m
33    end = m
34    total = 0
35
36    for _ in range(m - 1):
37        if i < m and (j >= end or q[i] <= q[j]):
38            a = q[i]
39            i += 1
40        else:
41            a = q[j]
42            j += 1
43
44        if i < m and (j >= end or q[i] <= q[j]):
45            b = q[i]
46            i += 1
47        else:
48            b = q[j]
49            j += 1
50
51        s = a + b
52        total += s
53        q[end] = s
54        end += 1
55
56    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": ""}
6
7    counts = {}
8    get = counts.get
9    for ch in text:
10        counts[ch] = get(ch, 0) + 1
11
12    freqs = list(counts.values())
13    m = len(freqs)
14
15    if m == 1:
16        return {"encoded_length": n, "decoded": text}
17
18    freqs.sort()
19
20    # 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 = 0
24    total = 0
25
26    while k < m - 1:
27        if i < m and (j >= k or freqs[i] <= merged[j]):
28            a = freqs[i]
29            i += 1
30        else:
31            a = merged[j]
32            j += 1
33
34        if i < m and (j >= k or freqs[i] <= merged[j]):
35            b = freqs[i]
36            i += 1
37        else:
38            b = merged[j]
39            j += 1
40
41        s = a + b
42        merged[k] = s
43        total += s
44        k += 1
45
46    return {"encoded_length": total, "decoded": text}