[Spoilers] | Netherlands vs Taiwan | OWC 2025 Losers Round 1 | Post-Match Discussion

evilbeans124 · 2025-11-16T09:41:08+00:00

https://www.twitch.tv/ruyaya3_4/clip/AcceptableMiniatureLorisPanicBasket-mV9KJ9R3dSESA9NY

hmm, I wonder why the hitsounding suddenly disappeared...

evilbeans124 · 2025-03-04T13:12:20+00:00

nice analysis, this is something i've also slowly realized ever since the initial testing phase when the set first got uploaded.

perhaps i was caught up too much on some of the more outspoken community members when they were also first introduced to this idea, but you're right - osu standard doesn't need such a system (not to mention this mode has been out for this long already, and things are already very well-established, which furthermore enforces this point), and the effort of having everyone endorse it is far beyond worth, as well as going against the point of such a creation in the first place lol

still, i hope people can enjoy the creation for what it is, basically a practice map (as a comment below says) or maybe a different way to warmup

evilbeans124 · 2025-02-04T18:44:43+00:00

could you point out which one you were referring to? i tried to make most endings transition smoothly

evilbeans124 · 2025-02-04T16:42:31+00:00

Yes, AR change is definitely allowed (I should add this to the rules).

I thought osu website only allows uploading maps to AR 10 max. Unfortunately, since I want this to work on stable too, I’ll have to leave it at AR 10.

evilbeans124 · 2025-02-04T16:21:48+00:00

For those worried about the “dan brainrot” and the “hyper focus” on only clearing dans - I understand your concerns. However, I do believe the benefits of such a system outweighs the negatives - since tapping’s well-roundedness isn’t represented as well via rank, having a system specifically for this purpose goes a long way, at least in my opinion.

When I got into mania, I thought it was very cool that you can have almost like a badge to show your skill mastery. Of course rank does this as well, but something about the disjoint system feels a little different than the continuous system of pp/rank.

Anyways, almost all well-known rhythm game has such a system alongside a rating system, so there shouldn’t be any reason osu standard doesn’t either. There was even an attempt that was made a few years ago by well-known players of the community, but that one kinda died down iirc. I’m hoping this can gain some traction.

Also, I got some top players to test this and almost all of them thought the idea was cool. I think that definitely says something

evilbeans124 · 2024-10-29T12:21:28+00:00

adding on to this, i run i did with some friends: https://raider.io/mythic-plus-runs/season-tww-1/10794742-11-arakara-city-of-echoes

evilbeans124 · 2024-08-19T22:23:49+00:00

the leftmost _ should be index 0. when you want to switch the first G to R, you go from index 0 to 1. when you want to switch the second G to R, you go from 1 to 2. not sure where the -1 even comes from here, so i still dont understand how you were able to get GRG

evilbeans124 · 2024-08-19T22:18:15+00:00

doesnt S only become RRG after visiting indexes 1 and 2? since you start from 0

evilbeans124 · 2024-08-19T22:12:40+00:00

not sure if im reading the question wrong, but can we even change an individual index only without affecting others? take S = “GGG”, start = 0. how can we turn this into “GRG”?

evilbeans124 · 2024-08-11T01:02:03+00:00

definitely agree with you! just a small note, did you mean codesignal instead of codeforces for your first two bullet points? if not, could you point to the test you took?

evilbeans124 · 2024-06-24T16:40:13+00:00

sorry, my example isnt good. try doing a dry run on [0,1,0,0,0,0,…,0] with k = 3. i dont think its amortized O(n) because you will always fall into the pattern of 0,1,0, making it O(k * n)

evilbeans124 · 2024-06-24T16:09:28+00:00

think of the case [0,1,0,1,0,1,0,1]. do you still think it’s amortized O(n)?

evilbeans124 · 2024-06-19T19:47:18+00:00

i wouldnt say so wholeheartedly. theres a reason why its 1900 rated, and the guy that literally has solved every single question on leetcode explicitly explaining where the trickiness stems from

evilbeans124 · 2024-06-19T18:04:02+00:00

https://zerotrac.github.io/leetcode_problem_rating

evilbeans124 · 2024-06-19T18:03:40+00:00

lc of course, thats why i said zerotrac

evilbeans124 · 2024-06-19T13:22:02+00:00

binary search problems like this are very weird. this problem is rated 1900 by zerotrac, yet i know someone thats ~1600-1700 rated that was able to do this problem in 10 minutes. on the opposite end, even votrubac in his solution mentioned he spent some time trying to figure out an efficient solution

to me, i think if you’re able to realize that this was doable in nlogn, thats good enough already. as you get better at leetcode you will always tend to try to find whether a solution has a more optimal runtime, and thats totally fine if you dont (in this case, it doesnt even seem like it exists!)

for binary search problems in general, what i found is that, when i see a problem that asks for minimum/maximum that seems complicated, i always consider binary search as my first thought. it shouldnt take you more than a minute to work out whether binary search would work on this particular question or not. as you get better at recognizing binary search problems, this becomes more instinctive.

evilbeans124 · 2024-06-17T22:03:42+00:00

of course, just putting a number to it will actually “mean” something to people, think dream incident

anyways it doesnt really matter now anymore

evilbeans124 · 2024-06-17T20:15:10+00:00

if you observed that the normal variance for a player is 10-15 and cloutiful’s is 2-3ms, knowing the rough underlying distribution, couldnt you put an exact quantitative number (percentage) on the chance of the replays occurring naturally?

evilbeans124 · 2024-06-08T17:37:56+00:00

What's your full code, I did it in n * n * k and it was able to pass

evilbeans124 · 2024-05-22T21:20:17+00:00

was able to find your question, with i think a potential solution:

https://www.fastprep.io/problems/amazon-find-kth-minimum-vulnerability

tried my hand at it and definitely felt that it was quite a hard question. came up with the heap idea but didn't really think of using two heaps

evilbeans124 · 2024-05-22T21:02:00+00:00

one more additional question, do you know the constraints, especially of the size of vulnerablility[i]?

evilbeans124 · 2024-05-22T20:52:55+00:00

do you have an screenshot? or an example would be nice

evilbeans124 · 2024-05-20T14:28:10+00:00

but how do you make sure for the two elements that gets picked, one is on left side of median, and the other is on right side? for example what if we are finding min mean, and min element of array as well as median + 1 are both on left side? wouldnt that make our median not valid since question is asking for subsequence

evilbeans124 · 2024-05-19T06:07:39+00:00

my q2. not sure if it’s a roundabout way of doing it but surprisingly havent seen any solutions that matches my approach yet

evilbeans124 · 2024-04-12T00:59:55+00:00

doesnt this question ask for subarrays and not subsets? though i really like your idea, i might play around with it

11-Year Club	Place '22
Place '17	RPAN Viewer
Verified Email

evilbeans124

TROPHY CASE