Hogwarts.dropout's blog

By Hogwarts.dropout, history, 13 months ago, In English

Hey guys! I was doing some problems when i faced situation where i get stuck and cant proceed further. Lately i m facing some problems in identifying dp questions . I know some of the standard dp problems but for new problems which i haven't seen before i used to judge whether its dp or not (mostly) by the constraints .

But lately this stupid approach of mine has failed miserably. in this Div2 D though n<=3k its easier approach is greedy and i was trying it with dp but didnt reach anywhere , i have seen some dp solutions too in standings but they are quite lengthy .

And the real problem comes when its linear dp which is what i fail to recognize most of the times . As in , this edu_D_problem.As in editorial i was ready for the ans with k>0 case but was doing a lot of casework(which is troublesome and given wrong results) for k<=0 which is avoided and done with dp in editorial.

Guys thats why i want some help regarding this issue. i did approach my friends regarding this issue and they too have more or less same problem . So asking from the community.

Full text and comments »

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

By Hogwarts.dropout, history, 2 years ago, In English

Can anyone please tell me How to get better at problems involving bits ? I know basic bitwise operations and how they work but still not able to solve problems involving bits :( any blog or links to list of problems will help ... thnx in advanced.

Full text and comments »

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

By Hogwarts.dropout, history, 2 years ago, In English

How to motivate yourself after repeatedly getting negative delta after positive delta , thus getting stuck at a place ;_; ?

Full text and comments »

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

By Hogwarts.dropout, history, 2 years ago, In English

what is the difference between gym contests and regular contests ? as there are no contests nearby i was going through gym problems , and they r really really good.

Full text and comments »

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

By Hogwarts.dropout, history, 3 years ago, In English

given a 2d(N*N) matrix...N<=5*10^3 ...maximize F(a,b,c,d)=A[a][b]+A[c][d] -|a-c|-|b-d| ...0<=A[i][j]<=10^9. output max value of F for (a,b) not equal to (c,d) i.e. 2 distinct points. i was only able to think of bruteforce hence TLEd :(

P.S. solved finally

logik

Full text and comments »

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

By Hogwarts.dropout, history, 3 years ago, In English

I know i will be getting highly downvoted for writing this , but i will still write this up because i really wanna put forward my point . I know sus is getting tremendous support for his anime blogs but i think the way sus blogs are getting upvoted its replacing some more important blogs from the recent action post like blogs telling about some other platform contest announcements or some Cf users sharing there approaches for a problem or explaining a tough topic . I therefore request everyone to stop this as some other blogs are getting affected a lot which are really useful (atleast for me who have started cp just now ). Thanks for reading this up and have fun doing CP.

Full text and comments »

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