Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official. ×

Amao_Fox's blog

By Amao_Fox, history, 2 hours ago, In English

On yesterday's ABC363, SH00QiNan got the first place in a very-very short time. It's a new account and never competed before. Also, there's a CF account named SH00QiNan, which is also a completely new account. 

Some of the gossips I heard as this account is controlled by six China NOI Silver player. (I don't believe) But even six best player can't solve problem so fast, I think.

 It's Affiliation is QFLS. I'm not sure what QFLS is, but I am in Changsha, Hunan, China, and there is a school named Qingzhuhu Foreign Language School, but it's a nine-year-school (which means the students are 6~15 yo)

 What do you know about this account, and what do you think?

 Purr, out Tourist and JiangLY! The 1st place is stolen by this account!

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

»
2 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

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

»
2 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

Their order of answering questions is very suspicious, and it seems that each question takes about the same amount of time to solve, about 2-3 to 4 minutes. I think this strange result is a bit difficult for both humans and AI to achieve.

Maybe the problems were leaked?

»
19 minutes ago, # |
  Vote: I like it +2 Vote: I do not like it

A quick skim through the submissions shows at least three code styles (one with the comment on the top, one who uses #define LL int, and one who uses typedef long long ll).

Some of the gossips I heard as this account is controlled by six China NOI Silver player. (I don't believe) But even six best player can't solve problem so fast, I think.

I don't think it's impossible. If you give each person 1 problem each (except one doing A and B), ~21 minutes (the maximum time the account took for a problem) sounds doable.