Problem Statement E869120 found a chest which is likely to contain treasure.However, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.He also found a string S', which turns out to be the string S with some of its letters ...
Contest URL:https://atcoder.jp/contests/agc056 Start Time: Duration: 180 minutes The point values will be 300-900-900-1600-1600-1600. We are looking forward to your participation! pi+2(considering the row as a circular vector). One shall just check that the number of connected components...
If I write an assert statement for the value of n being less than or equal to 1e5, the verdict is RE, while for 2e5+2 it is AC. → Reply swapnil07 5 years ago, # ^ | +5 Oh, there was a clarification as well, my bad. :( → Reply ...
To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters Show hidden characters Original file line numberDiff line numberDiff line change Expand Up @@ -6,19 +6,28 @@ import re import sys from pathlib import Path from...
you're right, regardless of his age, DEGwer had no right to call kid out publicly → Reply DEGwer 6 years ago, # ^ | +64 I was just angry because he said like it is AtCoder's failure. But now, I finished to write what I wanted to tell the community. I forgive him and...
Finally, we need to accommodate for the fact that we have picked the root randomly. This means that for any subtree we can now decide to remove the rest of the nodes, not belonging to this subtree. Here is my code. Reply If you're dumb like me, you can also code a DP(v, maxDep...
I like to create problems. I am proud and happy if the strongest contestants in the world try to solve my problems. There are many other good reasons to become the author of a contest, but there is also a very bad reason: compensation. It is a huge waste of time to be the author...
No, we can't re-arrange a particular string. → Reply » » » » » aditya_sheth 5 years ago, # ^ | -7 can someone explain why this works? My idea was to sort according to the minimum of opening-closing bracket at any point for each string. Then to use segment tre...