Блог пользователя Queue

Автор Queue, история, 14 месяцев назад, По-английски

I got a mail from Codeforces regarding that my solution matches with some other solutions for round 1786 A2. After checking those solutions I was shocked that they were exactly my solution. I think that most probably someone who solved A2, locked their solution then opened mine and shared it on some shady group. Being expert for around 6 months now, it would be messed up if I start plagiarising during contest and that too A2 ?! I am attaching my solution and the others, please look into it; I dont want the contest to be unrated for me and more importantly I dont want innocent people like me to suffer due to some -200 IQ moves by someone.

My Submission

Plag Solution 1

Plag Solution 2

Plag Solution 3

Plag Solution 4

Thank you for taking out the time to read this, I hope the truth prevails in the end.

MikeMirzayanov Please have a look into this

  • Проголосовать: нравится
  • +102
  • Проголосовать: не нравится

»
14 месяцев назад, # |
  Проголосовать: нравится +9 Проголосовать: не нравится

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

»
14 месяцев назад, # |
  Проголосовать: нравится +24 Проголосовать: не нравится

Usually when this happens it's because of someone unknowingly leaking code through ideone so I must ask you: Do you use ideone or any online IDE?

»
14 месяцев назад, # |
  Проголосовать: нравится +47 Проголосовать: не нравится

Hi!

I saw the solutions and the submission time(~1 hour from the start of the contest), so someone who locked his/her submission before 1 hour MAY be the culprit.

You can check yourself, in your Room#86, two people submitted locked before 1 hour, No. 5 and No. 15. Hope it helps!

Regards

»
14 месяцев назад, # |
  Проголосовать: нравится -10 Проголосовать: не нравится

You can check other people's solutions if you've locked your own problem? This feature should be banned!

  • »
    »
    14 месяцев назад, # ^ |
      Проголосовать: нравится +10 Проголосовать: не нравится

    This is for you to hack other people's solution. Note that you cannot copy the solution tho

»
14 месяцев назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

It's easy to see that there soulution just change nothing or little things and there submission time is later than you,so I think you can chat to MikeMirzayanov to ban them .

Wish I can help you.

»
4 недели назад, # |
  Проголосовать: нравится -56 Проголосовать: не нравится

In the lastest explanation of problem C in tle eliminator I have a doubt could you please answer that The explanation regarding the variable "cuts" is that it stores the number of subtrees of size at least "x", and the total number of cuts is computed as "cuts — 1". However, it's important to consider that there may exist subtrees of size less than "x" that we are not explicitly checking for. Could you please answer this doubt of mine

  • »
    »
    4 недели назад, # ^ |
      Проголосовать: нравится +3 Проголосовать: не нравится

    What is wrong with you? How does your question relate to the topic?