Muhammad-Saram's blog

AN INEVITABLE CONCERN! (Div.4)
By Muhammad-Saram, history, 12 months ago, In English
Disclaimer

Hello Codeforces!
I hope you would have enjoyed the recent contest Div.4 as its always easy for most of the community.
But there can be some problems,
And I would not like to waste your time on reading unnecessary things , so let me just start the real blog...
Today's contest's E problem 1829E - The Lakes was very much similar to this (or rather the same)
Actually the problem statements were different (but there was water in both ;) ) but the solution was exactly the same if you copy code of one problem and submit it into another it would get accepted but of course you would have to add/remove the code of multiple test cases.
Now what I want to say that this could be a coincidence , I don't want to blame any of the writers or testers but this thing needs be looked out. Because these kind of things really effects the contest results and hard work of many.
And the thing left about that the contest would be rated or unrated is simply the decision of MikeMirzayanov and the contest creators.

  • Vote: I like it
  • -17
  • Vote: I do not like it

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

Auto comment: topic has been updated by Muhammad-Saram (previous revision, new revision, compare).

→ Reply
»
12 months ago, # |
  Vote: I like it +24 Vote: I do not like it
This written in invitation came to my gmail
→ Reply
»
12 months ago, # |
← Rev. 3   Vote: I like it 0 Vote: I do not like it

Bro, this is the most basic graph problem, of course there was a same problem before.

And also Mike already has written a post about problems' coincidences

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

    Mike said that , you can't memorize all the contests' problems which have been like 5-6 years old not 5-6 days old . :)

    → Reply
»
12 months ago, # |
  Vote: I like it +10 Vote: I do not like it

This is definitely a classic computing problem, so the coincidence is probably intentional, you just happened to see it for the first and only time on leetcode.

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

To the ones who're saying that this is a basic/classic problem and for training, According to me this is not the right way of practicing , because if someone knows that this kind of problem already exists , then he would obviously go for the rating. And I mean you can't give these kind of problems straightforwardly and it just had been so recent in the Leetcode , That just an average active competitive programmer would have known it . But then again I only wanted to share my thoughts : these kind of things really effects the contest results and hard work of many.

→ Reply
  • »
    »
    12 months ago, # ^ |
      Vote: I like it +13 Vote: I do not like it

    I think the bottomline is: if you're an average active competitive programmer you probably aren't ranking in a Div. 4 contest, which, as I understand, is targetted to newcomers in competitions.

    → Reply
»
12 months ago, # |
  Vote: I like it +6 Vote: I do not like it

So bfs has appeared before? Crazy

→ Reply
  • »
    »
    12 months ago, # ^ |
      Vote: I like it -6 Vote: I do not like it

    Oh! Come on,
    I mean are you dumb??
    There are plenty of bfs/dfs problems but the thing I wanted to say that was both problems had exactly the same solution , like exactly the same, do you know what it means by exactly??
    e.g
    One problem asked you about the minimum number of roads to take from one city to another and the other could ask you tell whether there is a path from the top-left corner of a grid to the bottom-right corner , without visiting any cell twice and there are some cells that you can't visit.
    Now both problems use bfs but the code is not exactly the same.

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

I believe that problem A exists in many judges before the contest!

→ Reply