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

Автор avdp, история, 4 года назад, По-английски

One thing I noticed is if a user gets caught he gets more serious about changing code completely to avoid getting caught again. One thing I noticed is that my friends who did cheating once and twice who were caught successfully but now some still do cheating cautiously and they and their ID act as if nothing happened to them except some -100 rating that generally is not much visible to anyone as it shows that maybe contest went bad and not caught cheating(tbh). I know the account is deleted or blocked for more than 3 times in a row but people generally are cautious on the 1st and 2nd strike!

So suggestion is to add Caught Cheating : Number of times in Profile Section.

Similar feature is already added by Codechef too.

Benefits:

1) Some random person will think twice before cheating.

2) Genuine people will play as they will not like playing from such plagiarised ID.

3) 90-95% Persons who did once or twice will leave that ID and start fresh most probably.

Now some will say what if that person after creating new ID do cautious cheating. So the answer is obviously we cant stop them but even if this plagiarised count is visible, Many people will be creating new IDs and hopefull starting fresh w/o cheating.

Hope to see some changes and it would not take much of time to be implemented MikeMirzayanov

PS: You can suggest healthy suggestions to this and comment if something is found vague.

Полный текст и комментарии »

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

Автор avdp, история, 4 года назад, По-английски

1020B - Badge

Guys can Someone give me O(N) approach for this problem as When I checked around 20-30 solutions all were O(N^2) so I need a code basically as I have some idea that If a node is in cycle then the answer is the node itself and else the answer is nearest node in a cycle.

Please help me implement code for O(N).

P.S. I checked that no blog exists on this problem and Please forgive me as I know this may be a NOOB doubt and I have started learning Graphs a week back only.

Полный текст и комментарии »

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