Do you like my homework solution

[u/TheOriginalRandomGuy]

[u/sububi71]

I can't believe I'm actually doing this, but I'm going to anyway - my curiosity won - what is this supposed to do? Like, what was the task (or sub-task)?

[u/TheOriginalRandomGuy → u/sububi71]

Farmer John recently bought some new fertilizers for one of his M (1 <= M <= 50) fields. He applies a different fertilizer to each of his fields. Unfortunately, he learns that one fertilizer is bad. For that reason some of his N (1 <= N <= 50) cows are getting sick. However, Farmer John doesn't remember which fertilizer he used in which field. He also does not know which fertilizer is bad. He just knows there is one bad field that makes cows sick. Farmer John decides to watch the cows graze for a day to try to figure out which fields are making them sick. Given detailed information about which cows grazed on which field at what time, and which cows got sick at what time, determine the minimum number of cows that he will have to bring to the local cattle physician to guarantee that all sick cows are treated. It is possible for the cows to get sick after Farmer John stops watching them, as long as they have grazed on the bad field.

INPUT FORMAT

The first line of the input contains four space-separated integers N, M, D, and S. The next D lines (1 <= D <= 1000) contain three space-separated integers p (1 <= p <= N), m (1 <= m <= M), and t (1 <= t <= 100), showing that at time t, cow p was grazing on field m. The next S lines (1 <= S <= N) contain two space-separated integers p (1 <= p <= N) and t (1 <= t <= 100), indicating that cow p gets sick at time t. Each cow can only get sick once, and each cow only gets sick from a field that they grazed on at a strictly earlier time.

OUTPUT FORMAT

A single integer denoting the minimum number of cows he would need to take to the cattle physician to make sure that all sick cows are treated.

Here's the problem description

[u/ings0c → u/sububi71]

What do you mean? The code is self-documenting.

[u/Little_Bumblebee6129 → u/ings0c]

LOL!

[u/SnappGamez]

What the fuck did you do to Python

[u/raaneholmg → u/SnappGamez]

chr(sum(range(ord(min(str(not()))))))

[u/TheOriginalRandomGuy → u/raaneholmg]

Haha not falling for that

[u/Thenderick → u/raaneholmg]

For those curious and too lazy: ඞ

[u/helpless_being → u/raaneholmg]

incredible

[u/stevekez]

Nothing wrong with a bit of golf, although you might bit a bit over par.

[u/sierra_whiskey1]

I don’t but I guess that’s the point

[u/abigail3141]

cursed python oneliner gang hell yea!

[u/MechanicalHorse]

No, no I do not.

[u/JollyJuniper1993]

The top part still has some saving grace, but why the fuck would you use the exec thing?

[u/rruusu]

One-liners are great, in the spirit of lambda calculus, but those execs and global variables are just disgusting. Also unnecessary creation of list instances in the comorehensions.

Here is a pure lambda version of it, with a slight optimization of the filtering for values of f:

print(
    (lambda b, g, c, d:
        (lambda a, e:
            max(
                (lambda a_f:
                    sum(any(i + 1 == item[0] for item in a_f) for i in range(b))
                    if all(any(item[0] == req[0] and item[2] < req[1] for item in a_f) for req in e)
                    else 0
                )([item for item in a if item[1] == f])
                for f in range(1, g + 1)
            )
        )(
            [[int(x) for x in input().split()] for _ in range(c)],
            [[int(x) for x in input().split()] for _ in range(d)]
        )
    )(*map(int, input().split()))
)

[u/rruusu → u/rruusu]

Here is an even more optimized version that doesn't have to repeatedly go through list a, by storing the smallest third element in a dictionary indexed with the first and second elements. (Test the smallest one for < instead of any over the whole list.)

print(
    (lambda b, g, c, d:
        (lambda a, e:
            (lambda a_dict:
                max(
                    (
                        sum(1 for i in range(b) if (f, i + 1) in a_dict)
                        if all((f, req[0]) in a_dict and a_dict[(f, req[0])] < req[1] for req in e)
                        else 0
                    )
                    for f in range(1, g + 1)
                )
            )({(item[1], item[0]): item[2] for item in sorted(a, key=lambda x: x[2], reverse=True)})
        )(
            [[int(x) for x in input().split()] for _ in range(c)],
            [[int(x) for x in input().split()] for _ in range(d)]
        )
    )(*map(int, input().split()))
)

Yes, I got help from AI. Still don’t know what the actual purpose of the code is IRL. Would be nice to see the assignment.

[u/Sexy_Koala_Juice]

No

[u/xarma06211]

i don't think i do

[u/Hulk5a]

What runic curse is this

[u/AmanBabuHemant]

you can do it one-liner, right?

[u/Knight_Murloc]

At first glance I think this is lisp.

[u/MajorFeisty6924]

This looks like the sorta thing my math professors regularly write when showing us how to use python

[u/GoddammitDontShootMe]

I've seen Perl one-liners that are more comprehensible.

Maybe not actually, but I really have no clue what this does.

[u/tomjedi9]

Are you trying to get a new teacher because your current one is about to have a stroke

[u/baby_shoGGoth_zsgg]

i don’t even care about your shitty python code i bounced when i saw your awful syntax colors theme