hello_its_me's blog

Can't Solve Even Problem C
By hello_its_me, 11 months ago, In English

Hello coders
In most div2 contests i can't even do problem C if i have even 1 hour in hand. But many coders specially Grandmasters (not the LLM cheaters) and LGMs can solve them within 20 minutes or less. I have been doing cp for about 5 years now but still i am nothing more than a pupil. I know its practice but is that truly the only thing ? I am willing to give time to it but no matter which way i try to solve i always comeback to square one. I was struggling with Div2 C 2 years ago still today the same thing.. I solved many of them in my other account but if i chose 10 level C problems i can solve 3 of them i would say (that too with too much struggle) and the rest are just clueless for me. But i can do the first two problems in 30 mins to 1 hour but that's not good enough for me in comparison to the time i am giving to it. I want to solve at least 4 problems of Div2 in the whole time. I need to improve fast as I have given so much time to it. I wanna give this a final shot. Many people could even reach master or Grandmaster if they had put the time that i gave in cp. but somehow i am still a green coder. So can someone share your way of solving problems if you have overcome the phase where i am at right now ?

I am not bluffing. I meant everything I said here. You can clearly verify that by looking that this is not an AI generated post but written by a human. So Should i practice in other judges? Should I do advance problems of CSES after watching editorials ? or learn new algorithm ? please help me out. I am so pissed off at this moment.

Thanks a lot for your time in reading this. And sorry if i wasted your time but i had to post this as i dont know what to do next afterwards.

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

»
11 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Registered: 13 months ago

→ Reply
  • »
    »
    11 months ago, hide # ^ |
    ← Rev. 2  
    Vote: I like it 0 Vote: I do not like it

    i have told that this is an alt. For some privacy reasons i can't really post from the other account. but i meant everything i said in the blog this is what i can say at this moment.

    → Reply
»
11 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Try CP31 sheet

→ Reply
»
11 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Facing exactly same issue. Today I was not able to solve B. I cant belive how they can solve this quickly.

→ Reply
»
11 months ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

Hey! hello_its_me

I do not really know how much you have solved given that this is perhaps your alt account,but I certainly hope you have solved a good number of problems on all platforms. What I would suggest is that open up last 20 contests and solve C for Div 2s and E of the Div3s,and if you do not know the topic the problem is based on learn it. After trying for an hour watch the editorial and topic the problem was on and make sure you understand it properly. The change might not be visible instantly but I am sure after learning the ideas and topics needed in the last 20 contests you will be able think on your own at least for Div2 Cs. As for Div2 Ds I can not comment as I have not solved much.

Main Topics and Concepts up to Div2 Cs:

1.   Number Theory and Combinatorics
  - Prime Factorization
  - Sieve Algorithm and Its Use Cases
  - Stars and Bars(Basic)

2.  Binary Search
  - Binary Search On answer
  - Upper Bound and Lower Bound 

3.  Greedy
  - Exchange Arguments

4. Prefix Sum
  - Partial Sum
  - Difference Array

5. Dynamic Programming
   -CSES first 10 Problems

6. Bit Manipulation 
  - Think Bit by Bit

7. Graphs
  - BFS
  - DFS
  - Dijkstra

Nothing more is needed for Div2 Cs as far as I know.

Hope It helps.

→ Reply
»
11 months ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

i** know that im not the one to answer this , u may say u arent good enough** **** Not all preople are same i mean when two people enter CP they may didnt do cp before but one of them have better problem solving skills so the start isnt the same even if the time **** I think the most important thing in codeforces is speed , u dont want to solve hard problems to reach the rate u wish but just the problems that faces u at this rate **** There are other Factors that affect your performance like your debugging skills ,speed of typing , and very very bad factor (not enough time to read , think ) , the stress u put on yourself inside Real contest ****

my advice >> i think putting yourself in the mode of contests , Gyms(ICPC .. etc) and upsolving beside this learn needed topics , Consider this blog : https://mirror.codeforces.com/blog/pwned

→ Reply
»
11 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

https://mirror.codeforces.com/blog/entry/98621

I read this blog some months ago , I think it could guide u much better

→ Reply
»
11 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

I'm in the same boat. Can solve A and B but C is basically stratospheric levels beyond me. I think I will try to move slower without reading editorials. Today, I stupidly thought O(N^3) would pass. Only towards the end binary search came to mind but it was late and still am foggy on the idea.

I tried the Divine Tree from the previous match, I can see that n is the min and n*(n+1)/2 is the maximum but couldn't figure out how to utilize all the nodes.

→ Reply