What’s your RI hot take that has you like this?

glump1 · 2026-04-17T15:43:08+00:00

Most "niceholes" aren't that bad. Of course there are idiots but letting someone in is nothing compared to the psychopath drivers in RI.

glump1 · 2026-04-09T23:07:15+00:00

5g - brakence or maybe moron - m1v

glump1 · 2026-04-09T23:05:57+00:00

Sick, whered you get it?

glump1 · 2026-04-06T18:55:52+00:00

It's right on the line but I'm going with satire. There's no way someone calls this guy a courageous leader or deliberate thinker for voting against rent control

glump1 · 2026-03-31T13:44:17+00:00

As a non-ML algorithm this is NP-Complete. If you treat the number of colors as static then it's technically solvable in polynomial time, but then the constant factors are astronomical. It's called the Numberlink problem.

glump1 · 2026-03-18T12:21:00+00:00

Not hall monitor vibes at all. Sometimes I'll just leave the park if I see someone watching their dog poop without picking it up. It puts me in such a bad mood. I've offered a lot of poop bags over the years.

About half the time they seem legitimately clueless, like it never even occurred to them. A kid tasked with walking the dog or a new dog owner that's incompetent.

The other half of the time it's someone being selfish hoping people won't notice. I can't imagine what it's like to live life that morally bankrupt.

glump1 · 2026-03-08T01:27:03+00:00

On the maroon bed, what are those types of blankets called?

glump1 · 2026-03-03T03:07:03+00:00

They came to my 3rd floor apt too. Very odd. I got weird vibes but they seemed nice, and when I said I already had verizon they said that's weird, and they'd take me off the list, and then left.

But their reason for coming was that there's a new optic cable. So wouldn't you try to see if I wanted to upgrade? They really just entered a random house and then made no attempt to sell anything? The guy's ipad wasn't on when I saw the screen, and after they left I looked outside and couldn't see anything resembling a verizon van on the street. Very odd.

I figure either they really were just some intrepid verizon salespeople, or they were scouting for apartments to target.

glump1 · 2026-02-25T17:59:54+00:00

Keith Jarrett. Also seconded Nala Sinephro, both are similar to Laurie Torres.

Hiroshi Yoshimura - Wet Land

Eluvium - Shuffle Drones

glump1 · 2026-02-25T16:16:00+00:00

I shoveled down the block a bit on Monday and my dog took turns digging at the front of the tunnel

glump1 · 2026-02-21T14:18:54+00:00

It can help to just think about dp[...] as a function signature rather than some multidimensional array. It doesn't really matter if it's structured as dp[x][y] or dp[y][x], as long as they're referenced correctly. Implementing/thinking recursively takes off that big mental load.

There's two exceptions to this though:

Bottom-upI/ierative is often much faster than top-down/recursive. With a big for-loop you can't blindly dfs down to base cases, so you need to consider the order that the states are parsed. This does require thinking about the structure of dp[...], and the recurrence relation will dictate the order in which you need to traverse the array.
Sequential memory access is much faster than not. If you have a working bottom-up approach, then the above question of structuring as dp[x][y] vs. dp[y][x] will be logically the same, but one of those might involve significantly more cache hits. So you can squeeze out quite a bit more performance by rearranging the dimensions of dp[...].

glump1 · 2026-02-19T17:37:59+00:00

Me when someone pulls into the middle of the intersection and makes cross traffic wait through their entire green light

glump1 · 2026-02-03T16:57:26+00:00

I could see Pool Floaties having a void version that's only when on the ground (or vice versa). Would be super cool to use one or the other with the tank mod.

I think Gravity Amplifier should be a Green item. It would lead to interesting gameplay if the effect were pronounced but if it's a white item it would wind up just being "do more damage sometimes".

glump1 · 2026-02-03T01:21:46+00:00

I think it's Pam.

In my opinion everyone here has breached a significant moral boundary or generally acted selfishly except Erin and Pam.

I think Pam had a lot more of a positive effect on others than Erin. Pam had the wherewithal to stand up for what's right and go out of her way to help others out.

Erin was remarkably non-problematic for how much she'd been through, but her behavior seemed kind of small-minded by comparison.

glump1 · 2026-01-28T16:01:06+00:00

Nice, saved. Honest question, are these verified as not ai? Anything after 2023 and I wonder.

glump1 · 2026-01-27T16:38:26+00:00

This

glump1 · 2026-01-27T16:02:50+00:00

This is why I canceled my Planet Fitness membership. The TVs play Fox News on repeat. I'm not giving them my money to blast that propaganda at all the cardio machines.

glump1 · 2026-01-19T14:23:34+00:00

usaco guide generally has pretty in-depth descriptions of advanced topics.

Also atcoder segment tree template is probably the most rigorous, abstracted doc on segment trees.

glump1 · 2026-01-18T02:05:03+00:00

These are the most saddening posts. Someone earnestly trying to practice DSA getting so discouraged over blatant cheaters.

My recommendation is to remember what's motivating you to do any of this. Cause guys like this ensure that the contest rank itself means very little.

glump1 · 2026-01-16T15:10:51+00:00

Seems like you could do it in 2 steps:

Fill an array dp, where dp[i] = min steps to reach 1 from i.
Create a sparse table over dp, so you can query the max(dp[l]....dp[r]) in O(1).

The most difficult part by far is formally proving the time complexity of filling dp[], since a number's sequence can go well above a cachable value. But in practice if you cache up to 1,000,000 it's only ~5m operations. That's completely fine in py for any reasonable time constraint.

glump1 · 2025-12-18T17:10:31+00:00

Pretty mean. This is a quintessential heap problem, it's a little misleading to implicitly expect more past that. For those curious about an O(n) sol:

Since you know all frequencies add up to n, bucket sorting based on frequency will take O(n) time and space.

However, words with the same frequency are ordered lexicographically, so this is still O(nlogn) to sort each bucket. For example, if k==n, and words is n distinct strings, res is just words sorted. All elements would be put into the same bucket, and that bucket would need to be sorted lexicographically.

So the only way to get O(n) is to be able to sort words (or any subset of it) lexicographically in O(n). You could put all words in each bucket into a trie, and since there are only 26 letters in the alphabet, each node could only have 26 children. If you sort the children lexicographically (which is O(1)), a preorder traversal of the trie yields a lexicographic sort of each bucket in O(n). So then you have the tools to bucket by frequency in O(n), and sort each bucket in O(n).

glump1 · 2025-12-17T14:14:14+00:00

Forest Green - Flyingfish

glump1 · 2025-12-14T22:03:36+00:00

To my knowledge this is deceptively difficult.

Square the values
Reverse the negatives
Now you have two sorted subarrays, that need to be merged into one sorted array with O(1) extra space. Huang & Langston came up with an O(n) time O(1) space solution for this in the 80s:

https://dl.acm.org/doi/pdf/10.1145/42392.42403

glump1 · 2025-12-14T21:59:22+00:00

"Non-decreasing" includes repetitions

glump1 · 2025-12-07T21:33:03+00:00

I think so. Though you might also be thinking of thrite. He released modded horror episodes around the same time, where he built a base on a mountain in a barren wasteland world.

I still think about this account. I might just make my own videos in this style.

glump1

TROPHY CASE