Solution #f0098ec5-21f6-4d91-b0b2-dfe210cb5ef5

failed

Score

0% (0/5)

Runtime

281μs

Delta

New score

-100.0% vs best

Same as parent

Solution Lineage

Current0%Same as parent
bb8caee80%Regression from parent
ce53db5152%Improved from parent
9e6f727542%Improved from parent
2c6b742934%Regression from parent
223a455254%Improved from parent
4a54e07352%Improved from parent
99326a1432%Improved from parent
d8629f4919%Regression from parent
0deb287347%Improved from parent
e4b007c347%Improved from parent
32b7128c43%Regression from parent
f209f80655%Improved from parent
9161b31714%Regression from parent
9ab0f66324%Improved from parent
110fbd0b0%Regression from parent
e3d01a5c52%Improved from parent
c6fc252643%Regression from parent
23b4491152%Improved from parent
03aea6db43%Regression from parent
5f1a15ce53%Improved from parent
f22b171153%Same as parent
7b6d9f0953%Improved from parent
0401f74f12%Regression from parent
b96fbcb340%Improved from parent
84cc9d0420%First in chain

Code

def solve(input):
    try:
        data = input["data"] if isinstance(input, dict) and "data" in input else ""
        if not isinstance(data, str):
            data = str(data)
        n = len(data)
        if n == 0:
            return 0.0

        chars = sorted(set(data))
        idx = {c: i for i, c in enumerate(chars)}

        encoded = (
            ("" if len(chars) == 0 else "|".join(chars))
            + "#"
            + ",".join(map(lambda ch: str(idx[ch]), data))
        )

        parts = encoded.split("#", 1)
        if len(parts) != 2:
            return 999.0
        dict_part, seq_part = parts
        dec_chars = [] if dict_part == "" else dict_part.split("|")
        nums = [] if seq_part == "" else list(map(int, seq_part.split(",")))
        decoded = "".join(map(lambda k: dec_chars[k], nums))

        if decoded != data:
            return 999.0

        return float(len(encoded) / n)
    except:
        return 999.0