Solution #6aeac392-4ce6-4145-84df-2a6f57c5b863

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_range(lo, hi):
8        if hi - lo == 1:
9            return {text[lo]: 1}
10        mid = (lo + hi) >> 1
11        left = count_range(lo, mid)
12        right = count_range(mid, hi)
13        if len(left) < len(right):
14            left, right = right, left
15        for ch, cnt in right.items():
16            left[ch] = left.get(ch, 0) + cnt
17        return left
18
19    counts = count_range(0, n)
20    freqs = sorted(counts.values())
21    m = len(freqs)
22
23    if m == 1:
24        return {"encoded_length": n, "decoded": text}
25
26    q = [0] * (m - 1)
27    i = j = k = 0
28    total = 0
29
30    while k < m - 1:
31        if i < m and (j >= k or freqs[i] <= q[j]):
32            a = freqs[i]
33            i += 1
34        else:
35            a = q[j]
36            j += 1
37
38        if i < m and (j >= k or freqs[i] <= q[j]):
39            b = freqs[i]
40            i += 1
41        else:
42            b = q[j]
43            j += 1
44
45        s = a + b
46        q[k] = s
47        total += s
48        k += 1
49
50    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}