new solution for the hard variant#39
Conversation
Summary
|
GSheaf
left a comment
GSheaf
left a comment
There was a problem hiding this comment.
Whoops, didn't mean to close this outright.
I don't intend to merge this submission as-is, but that's quite the compression!
Does decompressing your string have the same improved average?
| # This is an optimized version of ganitsu_optim. | ||
|
|
||
| # I don't even know how I did it, but in the process of compressing the data | ||
| # I also improved the questions average |
There was a problem hiding this comment.
That is very interesting indeed... I wonder what changed.
There was a problem hiding this comment.
i did change the actual bytes where it helped shortening the string. for example:
>>> repr("\ude84")
"'\\ude84'"
>>> repr("\uce84")
"'캄'"
>>> it makes sense that some of these changes would be possible without changing the logic, since you could add or remove a question if you know the response is no (P or False = P).
it is interesting though that somehow i managed to change the actual logic in a way that doesn't break it.
on that note, I would remove the part that gives spaces in strings for free,
i manged to improve the complexity by about 290 just by replacing unicode characters with spaces
There was a problem hiding this comment.
I don't think I have to manually check every edge case where people can hack the efficiency score; I'll just arbitrate with my eyes.
But thanks for the submission!
2 participants
No description provided.