Rating changes for last rounds are temporarily rolled back. They will be returned soon. ×

gabrielwu's blog

Register for the Montgomery Blair Informatics Tournament 2020 Online Round!
By gabrielwu, 4 years ago, In English

If you are interested in participating in the Montgomery Blair Informatics Tournament, which will be held online from 1:00-4:00 PM EDT on Sunday (6/7/20), please register at https://mbit.mbhs.edu/.

Teams of up to 4 are allowed! Anyone can compete, but only teams of US high school (or middle school) students can win Amazon gift cards for prizes:

  • $50 per person for 1st place in Advanced Division

  • $25 per person for 1st place in Standard Division, 2nd place in Advanced Division, and 3rd place in Advanced Division

If you want to get a sense of what mBIT problems are like, take a look at the problems from our contest last November:

Message me or email mbit.organizers@gmail.com if you have any questions!

UPDATE: The contest is over! You can view all results on our website.

Here are the problems:
Standard problems
Advanced problems

You can test out your solutions by submitting to these CF contests:
Standard contest
Advanced contest

Here are the editorials and solutions:
Standard solutions
Advanced solutions

We sincerely apologize with for the technical difficulties, and are working to ensure it doesn't happen again. Thank you to everyone who competed!

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

»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I assume it's supposed to be (6/7/20)?

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
4 years ago, # |
  Vote: I like it -34 Vote: I do not like it

Is it rated?

→ Reply
»
4 years ago, # |
  Vote: I like it +14 Vote: I do not like it

Wow, what an amazing opportunity for teams of US high school or middle school students! It's a shame that I can't win any prizes, since I'm from Australia, but I'll be sure to stop by to check out some high-quality problems by high-quality problemsetters :)

→ Reply
»
4 years ago, # |
  Vote: I like it +5 Vote: I do not like it

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

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
4 years ago, # |
  Vote: I like it +36 Vote: I do not like it

Wow, I’m excited!

→ Reply
»
4 years ago, # |
  Vote: I like it +33 Vote: I do not like it

Seems interesting.

May I ask how the divisions compare to Codeforces divisions? That might help some people gauge difficulty if they don't have time to look at the sample problems.

→ Reply
  • »
    »
    4 years ago, # ^ |
    ← Rev. 2   Vote: I like it +3 Vote: I do not like it

    Standard is comparable to Div 3/Div 2 ABC.

    Advanced is comparable to Div 2/Div 1.

    → Reply
    • »
      »
      »
      4 years ago, # ^ |
        Vote: I like it +9 Vote: I do not like it

      I would say that Advanced is harder than that. It probably ranges from Div 2 C to Div 1 E.

      → Reply
»
4 years ago, # |
  Vote: I like it +39 Vote: I do not like it

Wow, celebrating the 10 year anniversary (plus a few days) of me graduating, very classy. :)

→ Reply
»
4 years ago, # |
← Rev. 2   Vote: I like it +3 Vote: I do not like it

is the website working well?

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    Our website is having some trouble. It should be back up soon.

    → Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Anyone able to access the website?

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +13 Vote: I do not like it

    Not yet, sorry. We're working on it.

    → Reply
    • »
      »
      »
      4 years ago, # ^ |
        Vote: I like it +8 Vote: I do not like it

      Can we expect some hints/editorials to the problems after the contest ends? or atleast access to solutions? I don't wish to attempt it if otherwise is the case. :sweat_smile:

      → Reply
      • »
        »
        »
        »
        4 years ago, # ^ |
          Vote: I like it +10 Vote: I do not like it

        Yes, we will release editorials after the contest ends.

        → Reply
»
4 years ago, # |
  Vote: I like it +13 Vote: I do not like it

I can submit code but it seems like the verdicts won't load.

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I can't see the verdict, getting not found error page :/

→ Reply
»
4 years ago, # |
  Vote: I like it +3 Vote: I do not like it

Will problems be made available to upsolve?

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Yes, I have updated the post with the links.

    → Reply
    • »
      »
      »
      4 years ago, # ^ |
        Vote: I like it +8 Vote: I do not like it

      Thank you, I enjoyed the problems and this contest. Apart from the technical issues, the team did a great job.

      → Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Is there any way we can get our submissions?

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    You can see the results on the leaderboard. If you really want to see the code you submitted for a specific problem, you can email us and we'll try to look for it (no guarantees though).

    → Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Also, what was the logic in hen hackers?

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +14 Vote: I do not like it

    The Hen Hackers solution was based around the following: First find out which letters are present in the solution (62 queries) Then, use length two queries as a comparator in a sorting algorithm. For example, to find out if a is before b ask "ab". This takes O(nlogn) queries. By the end, you will have sorted the password.

    → Reply
    • »
      »
      »
      4 years ago, # ^ |
        Vote: I like it +8 Vote: I do not like it

      This is soo cool!!

      I was trying the $$$O(n^2)$$$ sort + some optimizations. Never struck me to use it as a comparator in gcc sort!!

      → Reply
      • »
        »
        »
        »
        4 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        Glad you enjoyed the problem! I had fun writing it.

        → Reply
      • »
        »
        »
        »
        4 years ago, # ^ |
          Vote: I like it +1 Vote: I do not like it

        I spent some good time doing some random_shuffle to try to find the right place, and then I realized the binary search.

        → Reply
»
4 years ago, # |
  Vote: I like it +3 Vote: I do not like it

Would it be possible to add the problem names to the CF contests? Right now they are just "A -", "B -", etc.

(And if it would be possible to add the PDF in the CF contest that would be nice.)

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +19 Vote: I do not like it

    Yep, I've updated the problems and attached the statements under contest materials. Let me know if I made any errors.

    → Reply
    • »
      »
      »
      4 years ago, # ^ |
        Vote: I like it +24 Vote: I do not like it

      Thanks, makes it much easier to use! Appreciate it.

      → Reply
»
4 years ago, # |
  Vote: I like it +1 Vote: I do not like it

gabrielwu by when will the editorials of the advanced problems be published?

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    We are currently finalizing the editorials and will publish them shortly.

    → Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Editorials are now published. See the updated post.

    → Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

is the editorial published yet? if it is, can anyone please provide the link to that?

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    Not yet. I will update the blog when it's ready.

    → Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Editorials have just been published. See the updated post.

    → Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply