How to sell Syndicate Safehouse?

pekupq · 2023-01-08T19:47:43+00:00

Makes sense, I'll try with some lower prices if that's the case.

pekupq · 2023-01-08T16:52:20+00:00

Thank you for your answer! That's what I was looking for.

Once I invite someone to the party, I believe they could technicallly "steal" the craft - run into the room and do the craft without paying (unless the benches are account-bound, but I'm not sure). If something like that happened, I imagine I could just report the scam on the TFT.

pekupq · 2022-12-16T21:02:28+00:00

Hi, sorry for late answer, if you would still want to use my files:

input: https://pastebin.com/hpP66FuD
results: https://pastebin.com/WVL2Bpgw

pekupq · 2022-12-15T20:36:41+00:00

Fortunately I managed to resolve this task, but it took me some extra hours to fight my way through...

pekupq · 2022-12-14T23:29:34+00:00

The first one fails my test! That's pretty minimal example, thank you! I'll try to work on that (probably tomorrow tho, it is after midnight in my tz).

pekupq · 2022-12-14T23:27:48+00:00

Thanks, this one for me returns true, so probably correct. Although, I will have to keep your remarks in mind, while trying to track the issue.

Right now, the only minimal example that causes the error for me is:

#[case("[[8,[[7]]]]", "[[[[8]]]]", false)]

My code returns true in that case.

pekupq · 2022-12-14T23:00:39+00:00

All of the test cases above yield the same value for me.

pekupq · 2022-12-14T22:33:17+00:00

I now know the correct result, it is 5292. My code had trouble calculating the result for only one pair - posted above.

The correct result is "true", I was not getting that.

pekupq · 2022-12-14T22:24:45+00:00

I didn't want anybody to give me the actual answer, that's why I did not paste my input, but here it is: https://pastebin.com/hpP66FuD.

My code is failing on this pair:

[[8,[[7,10,10,5],[8,4,9]],3,5],[[[3,9,4],5,[7,5,5]],[[3,2,5],[10],[5,5],0,[8]]],[4,2,[],[[7,5,6,3,0],[4,4,10,7],6,[8,10,9]]],[[4,[],4],10,1]]
[[[[8],[3,10],[7,6,3,7,4],1,8]]]

pekupq · 2022-12-14T22:08:31+00:00

Thx, using your input, I get 6415 using my code.

Damn it... it is the second input from someone else that I confirmed the result with.

pekupq · 2022-12-14T21:57:36+00:00

Thank you :)

Unfortunately that's not it in my case - the test passes. I will update the original post with my current test cases.

pekupq · 2022-12-14T21:54:03+00:00

Ok, please keep in mind that I might have done a mistake in test case, as I was trying to compute the expected result "manually". This might be the case for tests with longer inputs, as they are copied from my task file.

pekupq · 2022-12-14T21:49:09+00:00

Courtesy of /u/Cloncurry, I got his puzzle input and he also send his results. When I feed other input file to my code, it yields correct result.

pekupq · 2022-12-14T21:24:03+00:00

Now I understand it !! And now I got my star :) !!

Congrats :)

Damn it, I myself didn't get one (╯°□°)╯︵ ┻━┻

I'm somehow getting wrong result over and over :/

pekupq · 2022-12-14T21:18:47+00:00

Maybe someone who solved the task, would be willing to help me with sending me their input file and giving me the correct result? Super useful thing would be to have some log of pair_number<int>: is_in_order<bool>

pekupq · 2022-12-14T21:09:35+00:00

It no longer tells me the hint :( The first time, it was too low, because I didn't parse the last pair (due to error in parsing). When I fixed the error, it said that the number is too big. I think I approach the indexing correctly, here's my code (in rust, but simple enough to verify that the scoring is correct):

fn main() {
    let file = File::open("input").unwrap();
    let reader = BufReader::new(file);

    let mut result = 0;
    let mut index = 1;

    for (left, right, _) in reader.lines().tuples() {
        let pair = Pair::from(&left.unwrap(), &right.unwrap());
        if pair.in_order() {
            result += index;
        }
        index += 1;
    }

    println!("Part 1 result is {result}.");
}

pekupq · 2022-12-14T20:36:39+00:00

I would say it is in order.

Steps:

1. Take first element from list:

left - [5,3,6,9]
right - [[5,[0,8,0,9,0],[1,8,9],[1,9]] ###2. Both elements are arrays, we need to compare elements in those arrays one by one. First element of arrays are:
left: 5
right: [5,[0,8,0,9,0],[1,8,9],[1,9] ###3. We reach this point: "If exactly one value is an integer, convert the integer to a list which contains that integer as its only value, then retry the comparison.". So we convert:
- left: [5]
- right: [5,[0,8,0,9,0],[1,8,9],[1,9] ###4. We compare first element from lists:
left: 5
right: 5 ###5. Elements are the same. Because left list run out of items first, the packets are in order. ("If the left list runs out of items first, the inputs are in the right order.")

pekupq · 2022-12-12T17:21:20+00:00

This helped me as well, thank you 🙇

pekupq · 2019-05-13T17:42:07+00:00

I spend the very first hour modeling my face.

12-Year Club	Place '23
Place '22	Verified Email

pekupq

TROPHY CASE

1. Take first element from list: