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

Автор SecondThread, история, 19 месяцев назад, По-английски

Meta Hacker Cup Round 2

Good morning! Meta Hacker Cup Round 2 starts on Saturday, September 24th in under 24 hours! You're automatically registered for Round 2 if you scored at least 15 points in Round 1.

Important info:

  • You'll qualify for Round 3 if you place in the top 500 in this round.
  • If you place in the top 2000 of this round, you'll win a limited edition Hacker Cup t-shirt.
  • If you qualify for Round 3 as well, and you place in the top 200 of round 3, your shirt will have a special "Top 200" badge on it.

We put a lot of effort into these problems, so hope you'll find this contest as almost as balanced Codeforces Global Round 5. Good luck, have fun, and we'll see you on the scoreboard!

Update: Editorial

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

»
19 месяцев назад, # |
Rev. 2   Проголосовать: нравится +10 Проголосовать: не нравится

Finally! I'm sick now but I hope I can get better tomorrow and get a T-shirt! Edit: I couldn't get anything. Maybe next year. Great problems through all the rounds though. I really enjoyed this contest

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

Very excited for this round!

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

Just curious, why did you guys decide to host hacker cup rounds in this time period which is different from other competitions like code jam and codeforces rounds?

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

    maybe u just answered your question?

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

      thats insane, but is that rly the reason tho. codejam is in different months and cf rounds probably will change their times for hacker cup

»
19 месяцев назад, # |
  Проголосовать: нравится +18 Проголосовать: не нравится

Don't forget to increase stack size. Related link to increase it (c++ & windows)

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

    can you please tell what is the stack size in MB using that number which you mentioned in the video?

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

I am unable to log in to Facebook due to "required maintenance". Will the contest be postponed?

»
19 месяцев назад, # |
  Проголосовать: нравится +8 Проголосовать: не нравится
»
19 месяцев назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

Even in this round, do we get only 5 minutes for submission? Reply fast plz

»
19 месяцев назад, # |
  Проголосовать: нравится +23 Проголосовать: не нравится

Is there any way to see the number of contestants who solve a problem from the scoreboard?

»
19 месяцев назад, # |
  Проголосовать: нравится +16 Проголосовать: не нравится

just wanted to suggest something in the Scoreboard UI. Currently, when we fetch the next pages (either using arrow or using start param in queryString), and then we filter out based on country, it displays results from the previously selected offset. It would be better to start displaying results from first page for the selected country because the #pages for a country <= #pages in final scoreboard. I hope that makes sense ?

»
19 месяцев назад, # |
  Проголосовать: нравится +2 Проголосовать: не нравится

I am getting "This page isn't available". Am I the only one?

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

The editorial for A2 says that all numbers are up to 1e9, whereas the problem statement mention that they are up just to 1e6. Which one is correct?

»
19 месяцев назад, # |
  Проголосовать: нравится +59 Проголосовать: не нравится

Please make sure to send t-shirts this year. Didn't receive last years t-shirt. :3

»
19 месяцев назад, # |
Rev. 5   Проголосовать: нравится +29 Проголосовать: не нравится

From last year 2700th to this year 935th, I am making progress.

Although I didn't qualify for round 3, it is still satisfactory because I won both Code Jam and Hacker cup T-shirt this year (I didn't get either of them last year). Therefore, no regret.

»
19 месяцев назад, # |
Rev. 2   Проголосовать: нравится 0 Проголосовать: не нравится

Just got an AC on D2 10 seconds after the contest :( . Only if there wasn't any validation and all.

»
19 месяцев назад, # |
  Проголосовать: нравится +10 Проголосовать: не нравится

One small suggestion if downloading/uploading the tests/results remains in the following years: let people who downloads the full input very close to the final time to still upload the output until the timer is up (i.e. probably a few minutes after the contest ended). It has just happened to me that I downloaded the full input for problem D1 less than one minute before the end of the contest and couldn't upload the solution on time just for a few seconds, and without the overhead of downloading/uploading I would have qualified to the 3rd round :(

Beautiful problems by the way!

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

    Yeah same :(

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

    Bad idea. It basically means extending a contest from 3:00 to 3:05 — assuming that a participant hits "start a timer" early enough.

    (One must pass validation first but it can be done with a brute force.)

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

      Yeah, now that you mention it, probably it wouldn't be fair for some people to have a couple of minutes extra. An alternative could be to make validation optional.

»
19 месяцев назад, # |
  Проголосовать: нравится -48 Проголосовать: не нравится

I want to fuck everyone who created that system of accepting tasks... Is it so essential to run some testcases locally?

Some laptops have small stack so they got RE when they test their code locally////

»
19 месяцев назад, # |
  Проголосовать: нравится +26 Проголосовать: не нравится

From 0 solve last year, I finally qualified for round 3 this year.

But I am not a fan of the Hackercup download and upload format. For D2 it almost took 2 minutes to run my code. I was confused if it was TLE or if the input was too large to process.

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

    Didn't qualify for round 3, but yeah from 0 solved to 2 solved this year, feels good

  • »
    »
    19 месяцев назад, # ^ |
      Проголосовать: нравится -7 Проголосовать: не нравится

    So, you'd get TL in traditional format

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

    We had a solution that solved it in n*log(n) time. If you had an n*log^2(n) solution, we let that pass as well, though it was a bit more inconvenient for you to run.

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

From what I understand, the hashing function's performance in A2 is based on the assumption that the values in the array would be randomly distributed.
During the round, I also thought that a simple order-agnostic hasher should work, but because any specially designed test case could easily break it, I stopped implementing half-way.
Since no info. was provided in the problem statement on whether the arrays generated would be random or not, is this something 'guarenteed' about hackercup test-cases, that they will always be random unless specified otherwise?

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

    I don't see how the solution assumes that the values are randomly distributed. We can guarantee that the hashes of combinations of numbers are approximately randomly distributed by randomly generating the hash of each integer.

    • »
      »
      »
      19 месяцев назад, # ^ |
      Rev. 2   Проголосовать: нравится 0 Проголосовать: не нравится

      Oh, I'm sorry.
      I was grossly overestimating the probability of the sub-arrays differing with 2+ numbers, and was thinking of using the hash function only as a pre-check.

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

      sir it would be great if u can give some good resources to learn more about the topic.Thank you.

»
19 месяцев назад, # |
  Проголосовать: нравится +5 Проголосовать: не нравится

Submitted D2 in the last minute and made it to Round 3. Phew...

Spent too much time debugging off-by-one errors.

»
19 месяцев назад, # |
Rev. 2   Проголосовать: нравится +13 Проголосовать: не нравится

SecondThread

What's the process of getting the t-shirt? This is first time I have finished amongst top 2000 competitors..

»
19 месяцев назад, # |
  Проголосовать: нравится +7 Проголосовать: не нравится

A2 use sigma i, simma i^2, simga i^3%mod , failed on only one testcase.....

Small suggestions, can you make the validate input larger? Seems the validate cases are too little & too small

»
19 месяцев назад, # |
  Проголосовать: нравится +10 Проголосовать: не нравится

It would be good to allow users to download all system tests before the contest starts. Anyways, they will be able to open it only when they have the password.

»
19 месяцев назад, # |
  Проголосовать: нравится +3 Проголосовать: не нравится

Is there any hacking phase or system testing phase now after this? I wanted to hack my friend's solution

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

Will there be any plag checks ? I came really close to qualify for round 3 :(

»
19 месяцев назад, # |
Rev. 2   Проголосовать: нравится +6 Проголосовать: не нравится

I had a different solution for A2...

  • Use 3 seg trees: 1 for xor, 1 for sum, and 1 for product%mod.
  • Then check if the xor, sum, and product%mod match for the 1st half and 2nd half.
  • »
    »
    19 месяцев назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    i too thought about this idea but i have considered only sum and xor (didn't got idea of product).

    i realized that considering only sum and xor doesn't work.

    is there any way to prove that there exists same set of elements if sum and xor and product%mod of two different sets are equal ??

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

Less than five minutes penalty to reach rank 2000 , I shouldn’t double check my code after passing the validation set next year!

»
19 месяцев назад, # |
Rev. 5   Проголосовать: нравится +6 Проголосовать: не нравится

Sadly FSTed in A2 in failed to qualify for Round 3.

My rank became $$${473 \rightarrow 973}$$$ :(

UPD: I just double hashed my single hashed solution and got AC as it was getting WA on just 2 test cases earlier... Hashing is a thing in which we shouldn't trust ;(

I used multiplicative hash trick (similar to XOR hashing).

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

    Which platform did you use to run test cases of A1, my laptop was not able to run the final test cases ;)

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

      Sublime Text with custom input/output.

      suggestion
»
19 месяцев назад, # |
  Проголосовать: нравится +17 Проголосовать: не нравится

Hi. This was my first Hacker Cup. So I don't really know how you operate things. Do I need to contact someone for the T-shirt? Or does someone reach us through email or Facebook?

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

    If you are lucky enough, you will be notified about your T-shirt.

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

    They don't reply to any contacts. You can only sit and wait

»
19 месяцев назад, # |
  Проголосовать: нравится +14 Проголосовать: не нравится

I got top 2000 in this round, how do I get the t-shirt? Do I need to contact them?

»
19 месяцев назад, # |
  Проголосовать: нравится +33 Проголосовать: не нравится

It's that time to get T-shirts again :D

Is there any chance we could get the T-shirts from last year as well? I know many of us didn't receive the T-shirts for 2021, so it would totally make my day to get one, even if it's one year after. (Having the T-shirt is more of a personal-pride thing than anything else; it feels good wearing a T-shirt that I won from a coding contest!)

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

    I read somewhere that they stopped manufacturing 2021 t-shirts, so chances are slim

»
19 месяцев назад, # |
  Проголосовать: нравится +44 Проголосовать: не нравится

I ranked 143rd in round 3 last year, where is my T-shirt?

Never got any email from facebook, neither do you reply to my email or DM.

»
19 месяцев назад, # |
  Проголосовать: нравится +11 Проголосовать: не нравится

Seeing many comments on the tshirt, I would like to share my experience last year. I almost missed the email on t-shirt because it was sent by a suspicious looking email address and ended up in my spam. I only learnt about it because a kind soul posted something on Codeforces that the weird looking subject title is actually the tshirt email. So I suggest: (i) checking spam folder regularly (ii) any kind soul who received the email to share on Codeforces so that we are all notified.

I also remember it won't be sent so soon — it was sent in Dec last year after the finals.