Solution #9bcd8c52-e05e-4028-a394-4e15a7047f97

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    _ = [counts.__setitem__(ch, counts.get(ch, 0) + 1) for ch in text]
9    vals = sorted(counts.values())
10    m = len(vals)
11
12    if m == 1:
13        return {"encoded_length": n, "decoded": text}
14
15    q = vals + [0] * (m - 1)
16    i = 0
17    j = m
18    end = m
19
20    def take():
21        nonlocal i, j, end
22        if i < m and (j >= end or q[i] <= q[j]):
23            v = q[i]
24            i += 1
25            return v
26        v = q[j]
27        j += 1
28        return v
29
30    total = 0
31    _ = [q.__setitem__(end + k, (lambda a, b: (total := total + a + b, a + b)[1])(take(), take())) for k in range(m - 1)]
32
33    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}