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

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

Hi Codeforces! This weekend we held the Stanford Programming Contest in an online format for USA High-Schoolers. Since it was online, the format allowed for teams of up to 3 members to use 3 total computers and the internet.

We wanted to share the problems with you, so we added the contest to the gym here. (thanks sqrtdecompton for graciously helping with that). Though it was a contest for high-schoolers, the problems should still be interesting for those below International Grandmaster. Try them out and let us know!

Thanks to all of the other problem writers: SherlockyHolmes, radeye, swagchicken, csullivan203, and xiaowuc1

And testers for excellent feedback: miagkov, gigabuffoon, I_love_Harpae, MTSranger, alueft, and inutard.

Solution sketches, judge code and data, and the official standings are posted in this google drive. They will later be added to our website as well. Apologies for only having screenshots of the scoreboard in the Drive, I ran into some Polygon issues adding a ranklist but will try to add the official standings to the Gym soon for those doing virtual participations!

Finally, once again congrats to our Advanced division winners!

  1. blair blezers: galen_colin, 12tqian, and gabrielwu
  2. Coast: rqi, nchn27, and ajpiano
  3. Alphastar Air: qiangbao, Giantpizzahead, and vrooooom
  4. 2 campers 1 cheater: Kininarimasu, SuperJ6, and codetiger927
  5. cowng: skittles1412, penguinhacker, and PurpleCrayon
  6. drop out of school and run away into the forest with me: qpwoeirut, codicon, and moo.

UPD: Added link to gym: https://mirror.codeforces.com/gym/103091

UPD2: Created ranklist here, which combines new VPs w/ official standings

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

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

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

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

Thanks for the problems, it was a great contest!

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

enjoyed the contest where gyrating cats participated

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

This was an amazing contest, and the problems were really, really good!

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

I like others really liked the contest, but you should probably add link to the gym contest on the blog.

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

The problems are very high quality and I would recommend teams to use this for practice virtuals.

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

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

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

Is there any editorial of the contest?

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

    Solution sketches, judge code and data, and the official standings are posted in this google drive.

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

can anyone plz. help me to briefly explain problem C — META FREQUENCY. Thanks in advance.

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

    You have an array, $$$A$$$, of size $$$N$$$, with each number being somewhere from 1 to $$$S$$$.

    Define a new array $$$B$$$, where $$$B[k] =$$$ the number of $$$i$$$ such that $$$A[i] \leq k$$$ (how many numbers in $$$A$$$ are less than $$$k$$$.

    Answer $$$Q$$$ queries, where each query is asking for a given $$$x$$$, how many $$$k$$$ such that $$$B[k] \leq x$$$ (how many numbers in $$$B$$$ are less than $$$x$$$).

    I've just translated the problem into notation, not sure how else to explain it, does that make sense?