Activity for Aftermost2167
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Edit | Post #287925 |
Post edited: Remove time constraint and clarify scoring |
— | almost 2 years ago |
| Comment | Post #287925 |
I've been thinking and I think it's just simpler and better to remove the time constraint altogether. It doesn't really add any real competitive value, since the point is already to get it as fast as possible, but doesn't discourage answers with esoteric languages or approaches, which may be interest... (more) |
— | almost 2 years ago |
| Edit | Post #287925 |
Post edited: Fix statement and example case |
— | almost 2 years ago |
| Comment | Post #287925 |
You're completely right! I mistyped the statement, it should indeed be 1s and not 0s, my bad.
Same for the example case, the anti-diagonal should be 4. (more) |
— | almost 2 years ago |
| Comment | Post #287925 |
Indeed, I will add those later today. (more) |
— | almost 2 years ago |
| Edit | Post #287925 | Post undeleted | — | almost 2 years ago |
| Edit | Post #287925 |
Post edited: Apply revisions from sandbox (https://codegolf.codidact.com/posts/287928) |
— | almost 2 years ago |
| Edit | Post #287928 |
Post edited: Make 20s the limit for everybody |
— | almost 2 years ago |
| Comment | Post #287928 |
Yeah, good point. Will leave the limit at 20s for everything.
Thank you so much for all the feedback! :3 (more) |
— | almost 2 years ago |
| Edit | Post #287928 |
Post edited: Clarify odd-sided quandrants |
— | almost 2 years ago |
| Edit | Post #287928 |
Post edited: Forgot to remove previous summary, and add more test cases |
— | almost 2 years ago |
| Comment | Post #287928 |
mmmm, I guess since the goal is to make it as fast as possible, a low upper bound isn't really necessary, since you won't win if you're too slow anways. However, I find that the tight bound can incentivize more optimal solutions.
I'm unsure what to do! x) (more) |
— | almost 2 years ago |
| Comment | Post #287928 |
Yeah, I want submissions to work correctly for inputs with 0 solutions. Will make it clearer. (more) |
— | almost 2 years ago |
| Comment | Post #287928 |
Yeah, I'm aware of that, and the intention is precisely to find all solutions, not just count them. It makes for a more interesting problem, in my opinion. (more) |
— | almost 2 years ago |
| Edit | Post #287928 |
Post edited: Improve problem statement according to feedback |
— | almost 2 years ago |
| Comment | Post #287928 |
I see what you mean. The point of the challenge is the decode the input and show how many solutions are possible, and output them, but I thought of lifting the need to display solutions if there were more than one. I suppose I could make it so you should always output the solutions you find. I will e... (more) |
— | almost 2 years ago |
| Comment | Post #287928 |
I should fix an input format. I was focusing more on the problem itself rather than the "fluff" around it, like input and output, but for the sake of being easier to evaluate submissions, those should be specified.
As for 0 solutions, they are indeed a possibility. I failed to make that explicit i... (more) |
— | almost 2 years ago |
| Comment | Post #287928 |
Good points!
The intro is indeed unnecessary, I will remove it.
You're also right about the column specs.
Regarding odd-sided matrices, they are valid inputs, I completely forgot to mention that. In that case, the quadrant boundaries are defined by the floor of side / 2.
Will edit the post, than... (more) |
— | almost 2 years ago |
| Comment | Post #287928 |
Yeah you're right, it's missing some more test cases, I will add those in a bit.
I intend to have some hidden cases still, as the solutions should not optimize for the given example cases.
As for my implementation, I have written it in C++, but your idea is nice. I will translate it to Python an... (more) |
— | almost 2 years ago |
| Comment | Post #287928 |
The spirit of this problem is rather alike a competitive programming project, hence the <1s restriction (almost ubiquitous in that environment). I'm more than happy to lift it for esolangs, however. They are fun! I think 20s max for esolangs is a nice limit. (more) |
— | almost 2 years ago |
| Edit | Post #287928 | Initial revision | — | almost 2 years ago |
| Article | — |
Decoding a non injective bit matrix encoding [FINALIZED] Now posted: Decoding a non injective bit matrix encoding The problem Someone has created an encoding format for square bit matrices, however they have found it isn't perfect! One encoding may not decode to exactly one matrix, or it may not even be possible to decode. Knowing this, you're... (more) |
— | almost 2 years ago |
| Edit | Post #287925 | Post deleted | — | almost 2 years ago |
| Comment | Post #287925 |
https://codegolf.codidact.com/comments/thread/7238#comment-19344
Ahah exciting!
I will delete/hide this post while we suss out the details on the sandbox then :)
Here it is: https://codegolf.codidact.com/posts/287928 (more) |
— | almost 2 years ago |
| Comment | Post #287925 |
Thank you!
I missed that sandbox, my bad :/ I will re-post there. Should we delete this or keep it and then update it once the details are set in the sandbox?
Either way, the idea here was really to make it as fast as possible, so I would be down to benchmarking every answer on my machine, if tha... (more) |
— | almost 2 years ago |
| Edit | Post #287925 | Initial revision | — | almost 2 years ago |
| Question | — |
Decoding a non injective bit matrix encoding The problem Someone has created an encoding format for square bit matrices, however they have found it isn't perfect! One encoding may not decode to exactly one matrix, or it may not even be possible to decode. Knowing this, you're tasked to write a program to decode a set of encodings and sinc... (more) |
— | almost 2 years ago |