liaoyanxu's blog

cheating?
By liaoyanxu, history, 20 months ago, In English

Yeah,as you see,many people did D in Codeforces Round 967 (Div. 2) ,my max rating is master,i use 1h30min to solve it,when i passed,there are 600+(rated) users passed.WTF?600+(rated)users are master????? Are you joking?????

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

Comments Comments (96)
| Write comment?
»
20 months ago, hide # |
 
Vote: I like it +141 Vote: I do not like it

all thanks to telegram groups

→ Reply
»
20 months ago, hide # |
 
Vote: I like it +42 Vote: I do not like it

I've heard about some people who manage to sell solutions to contests. I'm very interested to see someone who is willing to spend money on it

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

    grrrrr

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

    it can help them get noticed by potential employers, so it could be worth it

    → Reply
    • »
      »
      »
      20 months ago, hide # ^ |
       
      Vote: I like it +11 Vote: I do not like it

      I was never noticed by potential employers.

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

        but did you show off your rating on your resume?

        → Reply
      • »
        »
        »
        »
        20 months ago, hide # ^ |
         
        Vote: I like it +11 Vote: I do not like it

        Some companies do notice ratings, like Trilogy or Rubrik, but even there, they won't care about your rating if it is below CM; even Master, it should be for full-time employment.

        But still, there is literally no use in cheating to get that rating since the interview questions and OAs are way too hard (firstly, I don't think people can reach master since masters or GMs are rare and won't be helping losers increase their rating)

        → Reply
        • »
          »
          »
          »
          »
          20 months ago, hide # ^ |
           
          Vote: I like it +4 Vote: I do not like it

          It seems that they are helping such people increase their rating.

          → Reply
      • »
        »
        »
        »
        14 months ago, hide # ^ |
        ← Rev. 2  
        Vote: I like it 0 Vote: I do not like it

        18o3 U got into Google because of your rating man. During campus placements, I solved both questions of the coding round in Google but still was not shortlisted.But my friend who had a Master, IM, or even CM got shortlisted for further interviews.

        → Reply
»
20 months ago, hide # |
 
Vote: I like it +23 Vote: I do not like it

This user Pranavi_999 solved A,B,D all in Codeforces Round 967 (Div 2) as a Newbie. And Above all she solved them both in Java and Python what a joke

→ Reply
»
20 months ago, hide # |
 
Vote: I like it +3 Vote: I do not like it

I just happened to see one cheater too ig xD

→ Reply
  • »
    »
    20 months ago, hide # ^ |
     
    Vote: I like it -17 Vote: I do not like it

    Now that's fucking weird, I started from D, My solution literally uses a whole segment tree for both min max and It took my fucking 1hr to solve and 20 min to code And I was dbging for 5 minutes, how in the fuck did the cheaters leak that shit in 1:20 :sob:

    → Reply
    • »
      »
      »
      20 months ago, hide # ^ |
       
      Vote: I like it +30 Vote: I do not like it

      D actually could be coded in 20-25 minutes without a segment tree if you read well and didn't fuck up in de-abstracting your implementations.

      → Reply
    • »
      »
      »
      20 months ago, hide # ^ |
       
      Vote: I like it -8 Vote: I do not like it

      It's just a simple stack problem. Check this

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

        Can you please explain your solution?

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

          Keep track of the last occurrences of a number and use the partition to pop from the stack based on the problems description, and only pop if the top of the stack has more occurrences after the ith index

          → Reply
»
20 months ago, hide # |
 
Vote: I like it +186 Vote: I do not like it

At this rate, CF should split ranking system into two independent parts, Indian and non-Indian contestants. I might got down voted saying this but whatever, I don't care

→ Reply
  • »
    »
    20 months ago, hide # ^ |
     
    Vote: I like it +10 Vote: I do not like it

    Yeah that seems like a good solution (I'm indian) but for Indian users who have 0 skipped contests should be part of the rated participants too and everyone else unrated forever.

    → Reply
    • »
      »
      »
      20 months ago, hide # ^ |
       
      Vote: I like it +15 Vote: I do not like it

      Indian here

      Unrated forever?

      The plaig detection system isn't accurate

      My last div — 4 round's E submission was flagged for cheating. I appealed in the announcement blog but it didn't change anything.

      You can look at my submissions or ask for whatever information you require to prove I have never cheated in a contest. But still, there is a chance you get flagged and can't do anything about it.

      It doesn't matter now as I have reached Specialist again after the last round

      → Reply
      • »
        »
        »
        »
        14 months ago, hide # ^ |
         
        Vote: I like it -13 Vote: I do not like it

        I'm wondering why some of you thinks of something wrong on Indians,Dominater069 does well and reached IGM without cheating.Cheaters shouldn't be indentified by countries,cheaters are international,just think of how to develop anti-cheat system and tell Mike if you really care about that.

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

    what happens if they just change their country flag? maybe ip track somehow?

    → Reply
»
20 months ago, hide # |
 
Vote: I like it +29 Vote: I do not like it

And you don't need to be a psychic to guess where the majority of these people comes from.

→ Reply
»
20 months ago, hide # |
← Rev. 3  
Vote: I like it +11 Vote: I do not like it

d wasn't hard,just implementing, doamne sa nu pice la system test

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

holly shit

→ Reply
»
20 months ago, hide # |
 
Vote: I like it +46 Vote: I do not like it

Accounts with more than 3 skipped contests should be banned

→ Reply
»
20 months ago, hide # |
 
Vote: I like it -13 Vote: I do not like it

Lol, practice more. you're just pissed off that you can't solve these problems and others can, so you want to convince yourself it's all the cheaters' fault

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

I've become dumb or everyone has become so smart.

→ Reply
»
20 months ago, hide # |
 
Vote: I like it +27 Vote: I do not like it

People cheat...but I, I get cheated on :(

→ Reply
»
20 months ago, hide # |
 
Vote: I like it -42 Vote: I do not like it

I'm a newbie and solved it. You have to grind harder

→ Reply
»
20 months ago, hide # |
 
Vote: I like it +33 Vote: I do not like it

The data of D is too weak. Some people passed it by going through every value each time, which can have a complexity of $$$O(n ^ 2)$$$.

→ Reply
»
20 months ago, hide # |
← Rev. 2  
Vote: I like it +8 Vote: I do not like it

Cheaters should be banned because they pose the biggest threat to the community. Although I may not have much influence or experience, I believe that competitive programming is all about the adrenaline rush—the sadness of a wrong submission and the joy of an accepted one. If someone is truly passionate about competitive programming, they should focus solely on these experiences and problem-solving.

The real enjoyment of competitive programming comes when someone participates in contests and solves problems without worrying about their rating. One cannot improve if they are stuck in the loop of obsessing over their rating. Sooner or later, these cheaters will be banned, and at the very least, people from the programming clubs of institutes should monitor this behavior or teach students to either engage in competitive programming honestly or explore other fields, so they don’t harm this community.(just a random thought or maybe a vague idea)

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

I used to get under 3k rank last year then I stopped CP for a year, after I restarted, I could feel that I improved, solving higher rated problems but now I am being ranked below 7k in all contests I gave.

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

My main is expert , i couldnt solve C and took almost 100 mins to upsolve D. no way 2000 solns in contest

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

    Bro if you were able to please tell me how does my code be asking more than 15 n queries 277462404

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

      instead of using divide and conq , try using binary search . for 1 to each i run till mid and i dont giv mid output , there will be edge b/w mid and i

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

        But i just wanted to debug my code that where it might be failing

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

      because you're doing 2nlog(n) queries, try to check the edges only for j in your function and forget about i (because 1 is your root and you'll eventually get his edges from the other nodes). also remember to change your conditional at the end. here's the submission i made with your code 277556024

      ps: sorry for bad english

      → Reply
»
20 months ago, hide # |
 
Vote: I like it +3 Vote: I do not like it

keep your head up kings. the only advantage they have over us are the tg groups and some numbers. what if their usernames are more colorful than ours we are here on this battlefield to learn comradery, bravery, and to learn how to cope when defeated emotionally.

orz.

→ Reply
»
20 months ago, hide # |
 
Vote: I like it +51 Vote: I do not like it

man you were master for ONE contest and problem D was honestly pretty easy. You just needed to start implementing and develop intuition about construction process as you go.

→ Reply
»
20 months ago, hide # |
 
Vote: I like it +11 Vote: I do not like it

Look at these submissions. They are almost the same, except the variable names.

Please, look into this MikeMirzayanov

277404960 277378625 277394680 277386086 277365968 277367269 277386940 277379565 277414396 277390632 277384033

→ Reply
»
20 months ago, hide # |
← Rev. 4  
Vote: I like it +51 Vote: I do not like it

The Moderators of Luogu asked me to show this picture, hope it'll be useful.

Love from Luogu image. LOL

→ Reply
  • »
    »
    20 months ago, hide # ^ |
     
    Vote: I like it +5 Vote: I do not like it

    There's kernel-level anti-plagiarism check in Luogu.

    If you cheat when doing practices, all your AC records will be deleted (pretty cool).

    If you cheat in rated rounds, you'll lose lots of rating (getting -1 score).

    And after, you'll get a cheater tag and a "shit brown" name color everywhere for 14 days.

    Impressive, isn't it?

    Watch this Mike, when you got skipped in any problem you should get -1 score.

    → Reply
»
20 months ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

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

what about submission like https://mirror.codeforces.com/contest/2001/submission/277410926 just totally encrypted to cheat smartly

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

Just take less time to solve a problem??? Honestly D was pretty easy, I am not even master, but I mindsolved it in <= 10 minutes

→ Reply
»
20 months ago, hide # |
 
Vote: I like it +33 Vote: I do not like it

Solution for D has been released through tg groups, but with O(n^2) complexity, dumb cheaters didn't notice that. From room 1 to 30, 25 users have been hacked, (unfortunately, after the contest). Every 19 of 20 pupils/newbies wrote a similar O(n^2) solution. MikeMirzayanov, please kick those cheaters.

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

although i couldnt solve D in contest time, i wont say it was that hard, i solved it with segment tree after the contest . it took me about an hour .

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

it's very sad, I've been trying to solve this problem for 3 hours after the contest and I still can't solve it, although some people say it's very easy.

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

I have seen this guy UDITSHARMA111 solve Upto E in codeforces Round 967(DIV2) and got 96 rank and jump from 854 to 1383 and in previous contest it's all the solution got skipped

→ Reply
»
20 months ago, hide # |
← Rev. 3  
Vote: I like it +3 Vote: I do not like it

I don't think that a master should solve D in so long time... btw,cheating has become more and more serious...

→ Reply
  • »
    »
    20 months ago, hide # ^ |
     
    Vote: I like it +6 Vote: I do not like it

    Yeah,You are right. I used 3 segtrees to done it.(So stupid I am) But I'don't think so that many people could think the easy implemention of this problem fast,that's why consider cheating.

    → Reply
»
20 months ago, hide # |
← Rev. 2  
Vote: I like it +8 Vote: I do not like it

They only cheat once or zero times. Unless you have a lot of willpower. And I think we need to ban users who skip more than 2 times. shit┗|｀O′|┛

→ Reply
  • »
    »
    20 months ago, hide # ^ |
    ← Rev. 3  
    Vote: I like it +20 Vote: I do not like it

    Usually cheaters say non-sense. After having 100% similar D code to cheaters last round. They now say I just want the round unrated

    start of blog,

    He started defend himself by saying, why cheat problem B and C ? completely neglecting problem D then lots of trash then came problem D at the blog's end saying

    I did not get any WA because I recall solving a similar problem before. I really really do not know where exactly, and I do not think that explaining my solution will do any help. So yeah I did not fucking cheat it. (I think if I spent more 15 min trying to do with segment tree I would not get a skip

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

cheatforces

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

preaching

→ Reply