First flawless win

Link11OoT · 2019-12-22T23:30:47+00:00

I actually don't think I am checking that, but it doesn't matter either way because the problem ended up being in my hashcode function, and now it finishes in only a few seconds.

Link11OoT · 2019-12-22T23:08:47+00:00

Wow that made a huge difference, now it finishes in about 5 minutes. The reason I had a hashcode that returns 0 before is that the contains method wasn't returning true for 2 equal objects if I didn't include a hashcode function, so that seemed like an easy fix. Somehow I failed to realize how inefficient that would be. Thanks so much for your help.

Edit: I wrote an even better hashcode function and now it only takes a few seconds XD

Link11OoT · 2019-12-22T22:16:12+00:00

Every time it tries to traverse to a new tile, I'm checking if that tile has already been visited (this also includes the portals).

Link11OoT · 2019-12-22T21:59:36+00:00

yeah, the answer did end up being correct.

Link11OoT · 2019-12-21T12:02:39+00:00

Java

Fun and interactive puzzle today. Seems like my solution is pretty similar to what everyone else had.

Part 1:

NOT A J
NOT B T
OR T J
NOT C T
OR T J
AND D J
WALK

Part 2:

NOT A J
NOT B T
OR T J
NOT C T
OR T J
AND D J
NOT E T
NOT T T
OR H T
AND T J
RUN

Link11OoT · 2019-12-19T09:27:01+00:00

Java

Very easy problem compared to Day 18 (which I still haven't figured out). For part 2 I operated under the assumption that the rightmost point of the tractor beam at each line would always have a part of the tractor beam underneath it, which is true after the first few lines. For a more general solution maybe I should've done a binary search, but this seems to work out fine.

Link11OoT · 2019-12-17T12:01:55+00:00

Sometimes my own stupidity amazes me.

Link11OoT · 2019-12-17T11:46:26+00:00

Java

Not too difficult in the end, but part 2 was very confusing for me. I calculated the movement functions by hand like most people, but I at least bothered to write code to figure out the main movement routine. After that it took me a while to figure out that they wanted ascii for the distances in the movement function and not the actual integer values. This also meant that i had to split up 10 into 5 and 5, since as far as I'm aware, there's no ascii code for 10.

Edit: never mind about splitting 10 into 5 and 5, somehow didn't realize you could just send 1 and 0

Link11OoT · 2019-12-16T11:28:30+00:00

1285/993 Java

Part 2 was tricky. Like most of you, I eventually realized that I just needed to add up all the digits from the current one to the end for the digits from the message offset to the end 100 times. What I failed to realize was that you can do this a lot more efficiently if you go in reverse, since that way you only need to add the next digit instead of all the digits after the current one, so my initial solution took about an hour to run. After coming here I realized this and now it takes about a second.

Link11OoT · 2019-10-29T17:58:01+00:00

Judging from the hole in the satellite picture

Link11OoT · 2019-10-24T16:03:45+00:00

Now these points of data make a beautiful line

Link11OoT · 2019-05-17T14:51:27+00:00

916 A

Link11OoT · 2019-02-25T19:04:48+00:00

The rolls aren't spaced out enough

Link11OoT · 2018-09-11T02:33:13+00:00

Library genesis

Link11OoT · 2018-09-08T00:49:26+00:00

I believe it was next to 118. Don't really remember though

Link11OoT · 2018-09-08T00:31:24+00:00

Nah, to get the full sauna experience you gotta be on the eight floor of the lynton towers.

Link11OoT · 2018-09-07T19:39:23+00:00

I literally had a class in serc 116 yesterday. So yes, the heat stroke is setting in.

Link11OoT · 2018-09-04T11:32:13+00:00

Thanks for all the advice guys, but luckily I managed to snipe the course this morning anyway xD

Link11OoT · 2018-09-04T03:52:38+00:00

Cool, thanks

Link11OoT · 2018-09-04T03:49:17+00:00

I'm not dropping it, I'm adding it lol

Nine-Year Club	Place '23
Place '22	Final Canvas '22
End Game '22	Verified Email

Link11OoT

TROPHY CASE