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

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

Problem E is very similar to this on GFG: https://www.geeksforgeeks.org/find-two-numbers-sum-xor.

They are almost identical (you only need a small observation to notice they basically ask the same thing).

And when plagiarism checking begins, lots of people (including me) shouldn't get plagged bcz the authors created a VERY similar problem, that already exists.

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

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

I will likely get a skip. I copy pasted the exact code.

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

Yeah same here, although I've seen that in the past and could have coded on my own why not to find their code, copy paste, and save some time if it's allowed.

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

Totally Agree.

This is in accordance to rule that code was copied from a common published source on internet and should not be plagiarized.!!!!

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

Lots of competitive programming materials and online judges are there for decades. I think it is almost impossible to think about a problem that no one ever thought about before

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

    It is probably quite hard but I don't think its impossible. There are almost infinite ways to start with a well-known problem and then just slightly tweak it to make a whole new problem.

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

190856750

same solution , wow I hate cheaters.

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

    It is ok to use code published before the contest

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

      Use code such as a segment tree or any algorithm, but use the problem solution from a site without any personal effort?

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

        I don't understand, how is the person a cheater? He was able to reduce the problem to a well-known problem and got the solution online. I see nothing wrong with that. What personal effort are you talking of?

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

          You mean that it is fair that someone took the solution from a site and another person thought about the problem and solved it? Is this fair?

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

            I see no problem with that. Incase you never knew being able to search the internet properly could also be a useful skill in competitive programming.

            Btw, so is it okay to copy segment trees online? while another person codes it from scratch during a contest?

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

              So let's not use modern languages ​​like Java and C++ because they have libraries and we use Assembly so we can write everything from scratch LOL

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

                This is exactly what your first comment sounded like to me. If I know there is a solution to a problem already, why do I have to code it again? Especially when time is an important factor in CF contests. Maybe I could as well code my own custom sort during contests, instead of using inbuilt library methods.

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

                  Yes exactly, but this code is probably part of the solution, not the complete solution If this behavior is not cheating, I think this contest unrated

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

                  Again, there is nothing wrong with this contest. Sometimes in competitive programming you have reduce a problem to a well-known problem in order to solve it. Although, the reduction in this problem wasn't too much, it is not a duplicate problem. Have a nice day.

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

            It is 100% fair because it is explicitly allowed on codeforces (link).

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

Meanwhile, me(;-;) who checked for all the samples and random test cases by doing brute force instead of googling it. ;-;

Still, I support your point, both problems are almost identical.

MikeMirzayanov

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

i think contest should be unrated.as this supports cheating online.

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

Pretty sure intended solution is o(1) and much simpler than the one provided.190844276

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

Fun fact F in this contest was also very well-known centroid-decomposition problem. For example, 342E - Xenia and Tree and 100633D - LWDB

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

Problem setters should Google their own problem to make sure it's not super easy to just copy and paste from an online resource bc it's not fair if people who Google beat people who want to do it on their own

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

Yeah, but I did it by myself. I used O(t \times log2(x)) algorithm. If it becomes unrated, I will lose 300~400 ratings.