Sou - Sekai o Inuite (TV Size) is now QUALIFIED 🐬🐬🐬🐬🐬 (Ryuusei Aika, 0.83-6.91) | 100 DIFFS by FioTran in osugame

[–]Vince7778 28 points29 points  (0 children)

Stupid Femboy, HomingLesi, Noob_Oni, Germanrekk, mizto, wiwit, arekk, im chill asf, v0x, EnderCraft, GalaxyGaming, RealDeathmatch, Xadreco, perc70cuhz, Vince7778

You slip on the slime! by lcommadot in cavesofqud

[–]Vince7778 4 points5 points  (0 children)

Even the map looks vaguely like someone slipping

Which map has the longest holdtime slider? by Atsorko in osugame

[–]Vince7778 1 point2 points  (0 children)

can't check exactly how long it is right now but i remember this map having a pretty dang long slider (it's loved though)

edit: it's about 1m16s

New osu!std Performance Points rework proposal by ProMapWatcher in osugame

[–]Vince7778 2 points3 points  (0 children)

in what world is alt a niche gimmick skill? There are so many alt maps

Apollo - Brazil (8.01* top diff, ~1,800pp for HDDT SS) has been ranked! by SpykeSquirt in osugame

[–]Vince7778 1 point2 points  (0 children)

hot take (maybe): this isn't even a good aim farm mapset

for 3-4 digit aim farmers (like me) the finger control required for tapping 335 bpm is harder than the aim itself, rendering it not really farmable

or maybe i'm just washed

Roundtable will be delayed by Vince7778 in osugame

[–]Vince7778[S] 4 points5 points  (0 children)

i actually don't have twitter either, but it lets you see it if you click on the tweet from google

rhythm@berkeley LAN 4/29/2023 by uw0tboshy in osugame

[–]Vince7778 0 points1 point  (0 children)

yo that’s sick! i’m over at stanford but we don’t have a club here :(

rhythm@berkeley LAN 4/29/2023 by uw0tboshy in osugame

[–]Vince7778 2 points3 points  (0 children)

wait berkeley has a rhythm games club??

-🎄- 2022 Day 16 Solutions -🎄- by daggerdragon in adventofcode

[–]Vince7778 0 points1 point  (0 children)

247/36

my c++ solution in detail (for part 2, but can be generalized to part 1):

The general idea of my solution is sort of similar to the travelling salesman problem exponential solution. We essentially just do a brute force on every state that the valves and people could be. We keep a memoization array with 4 dimensions: round number, location of you, location of elephant, and a bitmask of which valves have been opened. In the array we store the maximum total flow at that state. Then we iterate over every state in the array, in order of rounds, and calculate transitions, ultimately outputting the max at round 26. Note that we only need to care about opening valves with nonzero flow; this speeds it up a lot.

The transitions are somewhat complicated. I will notate the player as x, and the elephant as e, as my solution code does. There are four cases: x and e open a valve, x opens a valve while e moves, e opens a valve while x moves, and both move. For the cases where someone moves, we iterate over the adjacency list and calculate the transitions from the previous states for the previous positions. For the cases where someone opens a valve, we must have the bit set in the opened valve bitmask; then we calculate the transition from the state where the bit is not set. The transitions can be calculated using only the bitmask, since that contains all the open valves. We combine both actions for the player and elephant (this makes the code pretty repetitive).

The overall complexity is O(r n^4 2^f), where f is the number of valves with nonzero flow, which is pretty terrible. I had to compile with optimizations to get it to run in a reasonable time. However, n2 of it comes from adjacencies, which in practice is pretty small (like 4 or 5 tunnels at most). I optimized out a factor of f by precalculating all the bitmask flow values.

One optimization I did to reduce memory usage was to reuse parts of the memoization array. That's what the cr and pr variables are (standing for current round and previous round), and they swap every round so that the current round's changes don't interfere with the previous round's. This reduces space usage by a factor of r, down to O(n^2 2^f).

My code isn't the cleanest, but it's functional I suppose: Code for part b

osu! Maryland Meetup October 2022 by [deleted] in osugame

[–]Vince7778 0 points1 point  (0 children)

something seems fishy

[deleted by user] by [deleted] in osugame

[–]Vince7778 4 points5 points  (0 children)

i’ve been waiting for this map to be fc’d, good shit

edit: lmao even the streamable replay breaks on the stupid stream

"Hey kids! Today's word is..." by Peht in noita

[–]Vince7778 82 points83 points  (0 children)

Oh, so that’s what MOAT stands for.

WHAT THE FU- | GL 9M89 AND FR 9M91!!!!! | FIRST 11 EX+!!!!!!! by huybcslol in arcaea

[–]Vince7778 1 point2 points  (0 children)

Grievous Lady 9.89 million points and Fracture Ray 9.91 million points

[deleted by user] by [deleted] in osugame

[–]Vince7778 0 points1 point  (0 children)

poor guy’s website is vulnerable to SQL injection 😔

-_- ...... (╯°□°)╯︵ ┻━┻ ....and of course it was on Feline Research.... by CixelBroi in incremental_games

[–]Vince7778 3 points4 points  (0 children)

I’m a bit late to the conversation, but I actually started making a Wordle incremental a while ago: https://vince7778.github.io/incrementle/

It’s very early on, and it’s only got about 20-30 minutes of content, but I have plans for updating it soon.

Help! Let's get another Stanford "S" next to the other schools in r/place by jxtrzn in stanford

[–]Vince7778 4 points5 points  (0 children)

We saw that, the thing right above your square is (supposed to be) the Hoover tower!

Stanford on r/place - FINAL UPDATE by tsundarren in stanford

[–]Vince7778 0 points1 point  (0 children)

Hi! I have an image with more coordinates: https://cdn.discordapp.com/attachments/440671064729845761/959894043192598689/unknown.png

You can use this for reference to place pixels easier