Codeforces Round #724 Omkar and Forest Solution (Java/C++)
Solution: There are two conclusions: For any point of the map, assume the value of this point is x. So, there must a path from this point, and the value of…
Codeforces Round #724 Omkar and Medians Solution (Java/C++)
Solution: First, we can find that: for b[i+1], compare to b[i], actually, we add two number to a: a[2i+1] and a[2i]. So, the impact to the median is limited to 1 position.…
Educational Codeforces Round 110 ABCDE Solutions (Java/C++)
A. Fair Playoff Solution: Just check whether the two winners are the first two largest after sorted or not. Code: Java C++…
Educational Codeforces Round 110 Gold Transfer Solution (C++ only)
Solution: First. Because the cost of child node must higher that their father node. So obviously, we will choose the shallower node. Then we need find the shallowest node which still have gold remained.…
Educational Codeforces Round 110 Playoff Tournament Solution (Java/C++)
Solution: Like segment tree. Maintain all the possibilities of the current game and the earlier game. For sample data, the Initial state:…
Educational Codeforces Round 110 Unstable String Solution (Java/C++)
Solution: First, consider if the string is unstable, then how many substrings is beautiful. For 010101, we found it can have 6 substrings which length is 1…
Codeforces Round #723 Oolimry and Suffix Array Solution (Java/C++)
Solution: Let us represent the string to c. First, we can notice that: for i<j, there must be $c_{s[i]}\leq c_{s[j]}$. For example, $[3,2,4,1,0,5,6]$, at least we have $c_3\leq c_2\leq c_4\leq c_1\leq c_0\leq c_5\leq c_6$.…
Codeforces Round #723 ABCDE Solutions (Java/C++)
A. Mean Inequality Solution: Sort the array. And split the array to two parts. Each time, we take one number from each of the two parts at a time.…
