Solution #5266c9ec-6ff5-445e-8459-1d713ef48118

failed

Score

0% (0/5)

Runtime

1.20ms

Delta

-100.0% vs parent

-100.0% vs best

Regression from parent

Solution Lineage

Current0%Regression from parent
da617b596%Regression from parent
06ed21e748%Improved from parent
b618404727%Regression from parent
35f1acec41%Regression from parent
aacb270845%Improved from parent
44170f1439%Improved from parent
d4a144706%Regression from parent
ac75ae0340%Regression from parent
5d1898f963%Improved from parent
669949f251%Regression from parent
cdf35bb558%Improved from parent
1c6ceef237%Regression from parent
a48275e057%Improved from parent
b6016c2857%Improved from parent
5fad927440%Regression from parent
cb4d87e147%Improved from parent
7f265cec45%Improved from parent
2143671f19%Improved from parent
c0d68d5c0%Regression from parent
ae54b0ca54%Regression from parent
e0f66b5554%Improved from parent
465e93a245%Regression from parent
73be1f5e49%Improved from parent
dd5155da19%Improved from parent
a9d69e700%Regression from parent
63acaad058%Improved from parent
1265a3fc48%Improved from parent
693a4dda33%Regression from parent
d5bf925948%Regression from parent
48e560c749%Improved from parent
78afbd2538%Improved from parent
f0098ec50%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):
    data = input.get("data", "")
    if not isinstance(data, str) or len(data) == 0:
        return 999.0

    # Implement LZ77 compression as a different approach
    class LZ77Compressor:
        def __init__(self, window_size=20, buffer_size=15):
            self.window_size = window_size
            self.buffer_size = buffer_size

        def compress(self, input_string):
            i = 0
            compressed_data = []
    
            while i < len(input_string):
                match_length = 0
                match_offset = 0
                for j in range(max(0, i - self.window_size), i):
                    length = 0
                    while (j + length < i and i + length < len(input_string) and 
                           input_string[j + length] == input_string[i + length]):
                        length += 1
                    if length > match_length:
                        match_length = length
                        match_offset = i - j

                if match_length > 0:
                    compressed_data.append((match_offset, match_length, input_string[i + match_length]))
                else:
                    compressed_data.append((0, 0, input_string[i]))

                i += match_length + 1

            return compressed_data

        def decompress(self, compressed_data):
            decompressed_data = []
    
            for offset, length, next_char in compressed_data:
                if offset > 0:
                    start = len(decompressed_data) - offset
                    end = start + length
                    decompressed_data.extend(decompressed_data[start:end])
                decompressed_data.append(next_char)
    
            return ''.join(decompressed_data)

    compressor = LZ77Compressor()
    compressed_data = compressor.compress(data)
    decompressed_data = compressor.decompress(compressed_data)

    if decompressed_data != data:
        return 999.0

    # Calculate sizes
    original_size = len(data) * 8  # in bits (assuming 8 bits per character)
    # Each LZ77 tuple can be encoded with bits for offset, length, and the next character.
    # Calculate how many bits approximately each tuple requires
    max_bits = self.window_size.bit_length() + self.buffer_size.bit_length() + 8
    compressed_size = len(compressed_data) * max_bits  
    
    return compressed_size / float(original_size)