itspyre's blog

By itspyre, history, 3 hours ago, In English

Soo basically I decided to post this as I recently hit 1572, an all time high after this round and I have a few questions about what Expert-level algos/tricks are, I know binary search basic stl, a bit of dp, trees and all that but I'm especiialy a bit bad on RQ, advanced data structures and high level dp. I ask to my 1600+ friends: What should I do?

  • Vote: I like it
  • +5
  • Vote: I do not like it

»
3 hours ago, hide # |
 
Vote: I like it +4 Vote: I do not like it

I don't think that I can give that valuable advice but, to get expert you can just be lucky and guess the solution with intuition proof. One thing I feel like is very underrated in CP, in which I think helped me alot is to think reversely whether in order of operations or order of array, I think to get to expert you don't need that much complex data structure or tricks.

  • »
    »
    3 hours ago, hide # ^ |
     
    Vote: I like it +6 Vote: I do not like it

    would you be able to elaborate a little more on the order of operations and array part please?

    • »
      »
      »
      3 hours ago, hide # ^ |
       
      Vote: I like it 0 Vote: I do not like it

      Order of operations is just like reverse greedy and mostly just think backwards. The array part is just what I did on R1126B which I randomly guessed that both will take the arrays from the currently maximum value, which is the opposite of MEX. I don't have any formal proof but it is what it is. These are just thinking reversely, backwards or think the opposite of what is given. Since guessing on CF apparently is somewhat real, I just got lucky this round though since most of my guesses were right except for E where I spent a lot of time exploring solutions. And I did these guesses because I just finished reading Zhtluo 's blogs on guessing which made me pretty confident with my guesses.

      • »
        »
        »
        »
        3 hours ago, hide # ^ |
         
        Vote: I like it 0 Vote: I do not like it

        I somewhat guessed the solution for D too and it was right but I didn't have any time left to implement it sadly. I think iirc there was 5 mins left to implement D in the contest lol