mshiladityam's blog

By mshiladityam, history, 7 weeks ago, In English,

https://codeforces.com/contest/1269/problem/D Can anyone please do me a favour and check if this problem can be solved without Graph Theory, DFs, some advanced data structure or some esoteric math theorem. After my exams, I want to solve this problem if this can be solved by not too heavy combinatorics, greedy or dp. My question is: is this problem ad-hoc, or does this require some knowledge of advanced combinatorics or very advanced number theory? Please reply in yes or no, and don't spoil anything :)

Appreciated!

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

»
7 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

ad-hoc

»
7 weeks ago, # |
  Vote: I like it -11 Vote: I do not like it

You can do it with dp.

  • »
    »
    7 weeks ago, # ^ |
      Vote: I like it -11 Vote: I do not like it

    Dude I said don't spoil it. Just say whether this is ad-hoc or not.

»
7 weeks ago, # |
  Vote: I like it -7 Vote: I do not like it

Why is this blog post downvoted? I am asking for help: isn't this blog posts are meant for? And my question is pretty clear and unambiguous too.

  • »
    »
    7 weeks ago, # ^ |
      Vote: I like it +14 Vote: I do not like it
    1. Undeniably, there is a phenomenon called "ratism" in Codeforces. In general, people believe that a post by a Master is good, while a blog by a Newbie sucks. Note that here I quote "in general", I do not assume everyone has the same biased thinking. So your blog gets down-voted, even though the quality is OK (OK here means it doesn't deserve to be down-voted like this).

    2. Your request is clear enough, but it doesn't attract interest. First, it could be resolved by checking the tags of each problems. Second, if you don't want to see it, just try to model the problem as a graphs and think through it. There is editorial blog too, and the editorial blog resembles a forum for each people to discuss after the contest. In short, there are various tools you could use to resolve your question, and you don't have to create a new blog to do it.

    3. Some tips (from my personal experience) for a good blog: I usually up-votes contest-announcement blogs (all kinds of contests including Codeforces, Atcoder, USACO, COCI,...), editorial blogs, useful tutorial/resources blogs, interesting idea-discussion blogs,... I don't like trash blogs such as "how to solve this problem" where they just post the problem link and their code without detailedly describing their progress and difficulty. Your blog, however, is better than those, still, I don't see the real effort you put in the problem (questioning the "tags" of the problem counts as effort?), thus your blog is kind of dull to me.

    In summary, "ratism", no matter how much we try to eliminate, is still there. So learning to deal with it is useful.

    • »
      »
      »
      7 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Yes, I will deal with ratism by increasing my rating :). I don't think my rating is really representative of my strength as I haven't participated in contests for a long time and have practiced very hard in the time between, though we will see when I actually start giving contests.

      Of course, you are not saying whether I am a newbie by ability or not, but still ;)

      1. I checked the tag of the problem, but there are certain problems which don't have tags of Graphs (especially those near 2000) but use some theorems of Graph Theory. **I haven't started studying graph **, so I can't even judge what Graph problems look like.

      Also, I don't want to spoil myself by seeing the editorial, so.....

      Again, I thought Young diagrams are a thing, and some properties are required to solve this problem.

      So I really needed the help of this community :(

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

      You see, I wasn't a newbie by ability ;)