yeah, that should be because of the condition 1 <= p_i < i which I didn't pay enough attention to realize building a tree and executing a DFS to check for depths was really unecessary

for D i somehow completely forgot that (a * b) mod c is the same as ((a mod c) * (b mod c)) mod c and used 128 bit integers to compute a * b, wtf is wrong with me

Thought of some weird idea for D during the contest, like "Pick the letter that currently has the highest available amount that does not violate the conditions. If more than one letter is possible to choose, pick the one that is the longest last time used". Then I thought "naaahhh, must be something else" and failed. Turns out my idea was correct somehow 367693038

B as in "Brutal"

The graph is not directed, that's why

I don't think so, all permutations of 3 3 3 10 gives an answer of 16

What a great contest, probably my best performance ever

I tried some weird reversed path approach that required the usage of a set, couldn't think of something smarter or simpler because of lack of time :/ anyways, good solution by you, your code is way smaller than mine

:( that's pretty straightforward and unfortunately I didn't see it

Submitted D with 1 second left only to be TLE'd in a single test case due to the use of set instead of unordered_set :( also what is this C lol I used a randomized algorithm to solve it lmao

Me too, right when I was in the middle of a virtual contest :(

i'd be moved by your words if this contest wasn't this much garbage

yeah I did that as well on 322751333 during the contest, and for this one the only missing thing was handling the repeated character operation. Unfortunate! I might have missed my chance to get Expert for the first time :/

lmfao forget it i just saw my mistake, i never expected there to be operations like a a, b b and c c, and because of that i'm inserting some wrong stuff into my sets, what a dumbass mistake lol

I saw your submission for E, and I'm failing to see any logical difference from my one of my own attempts 322744022 yet I got WA, would you know what am I doing wrong?

For the Range Interval Queries, I'm struggling to find out why my implementation of Merge Sort Tree gets TLE

https://cses.fi/paste/f21d39c5ee195b1bc607b8/

In fact, I solved it using Wavelet Tree and after I tried submitting the official solution from CSES that uses Merge Sort Tree and even their code gets TLE as well

Any thoughts?

The amount of cheating in this round was truly disgraceful.