### awoo's blog

By awoo, history, 6 months ago, translation,

1657A - Integer Moves

Idea: BledDest

Tutorial
Solution (Neon)

1657B - XY Sequence

Tutorial

1657C - Bracket Sequence Deletion

Idea: BledDest

Tutorial
Solution (vovuh)

1657D - For Gamers. By Gamers.

Idea: BledDest

Tutorial
Solution (awoo)

1657E - Star MST

Idea: BledDest

Tutorial
Solution (awoo)

1657F - Words on Tree

Idea: BledDest

Tutorial
Solution (awoo)

• +119

 » 6 months ago, # |   +59 If you are/were getting a WA/RE verdict on problems from this contest, you can get the smallest possible counter example for your submission on cfstress.com. To do that, click on the relevant problem's link below, add your submission ID, and edit the table to increase/decrease the constraints. A: Integer Moves B: XY Sequence C: Bracket Sequence Deletion D: For Gamers. By Gamers E: Star MST F: Words on Tree: Will add if anyone's stuck on debugging (only till the next 7 days). If you are not able to find a counter example even after changing the parameters, reply to this thread, mentioning the contest_id, problem_index and submission_id.
 » 6 months ago, # | ← Rev. 2 →   -41 video solution in Hindi -problem A Integer moves
•  » » 6 months ago, # ^ |   -30 video solution in Hindi-problem B XY sequence
 » 6 months ago, # |   +13 BledDest thank you for such an interesting and good task D. I hope there will be more similar tasks
•  » » 6 months ago, # ^ |   0 I agree!!
 » 6 months ago, # | ← Rev. 3 →   0 Update:-I got it from the editorial thank u authors.can someone please explain me the problem e i m unable to get it from the editorial.Thanks in advance.
 » 6 months ago, # |   0 More contests like these please!!
 » 6 months ago, # | ← Rev. 2 →   +1 There are two different $k$ in the editorial of E.
•  » » 6 months ago, # ^ | ← Rev. 3 →   0 awoo, please if you can make me understand the second part of the editorial of problem E (I am very much confused about the k's in the editorial ) and how the answer is written in dp[k][n] like we have n not k vertices. It is actually written the opposite (I think so) so please can you make me understand what is actually happening in the DP part of the editorial(how actually things are working) and what the two k's are? Seen the implementation but of not much help. Sorry if i am making it long.
•  » » » 6 months ago, # ^ | ← Rev. 3 →   0 BledDest and awoo the editorial and the implementation in problem E are totally different can anyone please explain what's happening in implementation motivated from editorial.
 » 6 months ago, # |   0 I can't understand this line from the D's tutorial. Can anyone help? You can see that for each cost c we can only leave one unit type of that price that has the largest value of d⋅h. Let's call it bstc. Thank you, in advance.
•  » » 6 months ago, # ^ | ← Rev. 2 →   +4 suppose we have warriors h1,d1,c and h2, d2, c. They have the same cost. In this case we can pick one which have greater h * d and discard another from consideration. In other words for each 1 <= c <= C we can keep max 1 warrior with highest d * h
•  » » » 6 months ago, # ^ | ← Rev. 2 →   0 Thank you @Alexey.
 » 6 months ago, # |   0 I did the problem C with a time of O(n) but i still got a limit exceeded. I use python, could anyone give me some hints or maybe tell me what I did wrong?150886506 Thanks in advance
•  » » 6 months ago, # ^ |   0 In your solution you never increase i in some cases where it does not end with ')'. For example, ')(' or ')((' or ')(((((((' will never terminate.
•  » » » 6 months ago, # ^ |   0 Thank you so much! Now it works
 » 6 months ago, # |   0 To, The maker of problem C.Hats off to you bro. Just amazing!!!!!!
•  » » 5 months ago, # ^ |   0 I agree problem is elegant. I came up with this extension of the analysis:https://techvineyard.blogspot.com/2022/04/string-parsing-with-finite-state-machine.htmlit's string parsing against a regular expression, using a Finite State Machine.
 » 6 months ago, # |   0 E is very beautiful! Thank you.
 » 4 months ago, # |   0 In problem C if I give the input as ())( then the expected output should be 1 0 as the given input is a palindrome, but the solution provided in the editorial gives 1 2 as the output when run, which means that we have to leave the last 2 characters in the string, I don't understand how 1 2 is considered correct, can someone please explain. Thanks in advance.
 » 7 weeks ago, # |   0 In problem C, if we give the input : 5 ((((( the expected answer ACC to editorial is 2 1. However, I feel it should be 1 0 because it is already a palindrome and it will take only 1 operation to delete it. Can someone kindly point out where's the flaw in my thinking process?
•  » » 7 weeks ago, # ^ |   0 Because You have to always take the shortest prefix meaning (( and (( and (.
•  » » » 3 weeks ago, # ^ |   0 you mean (( and (( and (