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

Автор Medo., история, 6 лет назад, По-английски

Time : https://www.timeanddate.com/worldclock/fixedtime.html?msg=SRM%20727&iso=20180111T0200&ah=2&am=0

Author is Errichto

Also check : http://codeforces.com/blog/entry/57011

Please do not upvote my SRM blogs. I don’t want my contribution sky rocketing for something I do not take credit for. I only aware you so you don’t miss SRM’s like I did when cgy4ever ( or in the past, Chrome) stopped posting them.

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

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

"Please do not upvote my SRM blogs." — why not? You are definitely bringing value to this community which is broadcasting information about upcoming competition that many people would probably miss without you. Even if you are not the author etc. I would say this is valuable contribution, we need such people and such blogs.

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

The registration terms in both arenas:

Registration Terms:
This is an unrated match, part of a private event.

Huh, is that right?

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

    I have also came across this problem. I’m sure that this statement is copied from Wipro Internal SRM. Can you inform to admins if someone can? (I can’t contact because I am out and I have no slack app in my phone, though I wrote here https://apps.topcoder.com/forums/?module=Thread&threadID=910926&start=0&mc=1)
    UPD: Seeing Errichto’s comment, the problem seems to be fixed. Thanks to topcoder admins for the fast problem solving.

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

    From arena chat:

    NobuMiu> unfortunate copy+paste
    NobuMiu> I saw a comment -> admins: The statement for registeration is wrong — this should be a rated match and public event
  • »
    »
    6 лет назад, # ^ |
    Rev. 2   Проголосовать: нравится +47 Проголосовать: не нравится

    I've just emailed admins, just in case. It should be a standard rated round, I think.

    Also, a reminder: the contest will start in 3 hours.

    EDIT — official response is: the info was incorrect, sorry for a mistake.

    So, the round will be standard and rated.

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

Congratulations to lych_cys for winning and to a close runner up, sunset. Both managed to solve easy+hard, while nobody managed to solve all three problems.

div2-easy MakeTwoConsecutive — code

Spoiler

div2-med TwoDiagonals — code

Spoiler

div2-hard ManageSubsequences — code

Spoiler

div1-easy OnlySanta — code

Spoiler

div1-med Subrectangle — code

Spoiler

div1-hard DoubleLive — code

Spoiler

How did you like the problems?

Two extra challenges:

  1. Solve div1-easy with the two special subsequences also given in the input (instead of hardcoding "SANTA" and "SATAN"). It can be done in linear time O(sum_of_lengths).
  2. Solve div1-hard for B, H up to 109 and T up to 3000. (it isn't much more complicated)
  • »
    »
    6 лет назад, # ^ |
      Проголосовать: нравится +25 Проголосовать: не нравится

    I really like hard problem even though this was the only one I did not solve. Easy and medium are okayish.

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

    Maybe 500 is harder than 900 because I solved 900 easily but I couldn't find a good way to solve 500:D

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

      Yeah, it's perfectly possible to come up with 900 fast and struggle with 500. Maybe it would happen to me too. Still, the 500 was much easier for the majority.

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

    I should have checked the winner on CF first, before I decided to blindly challenge his hard solution...

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

    I liked div1-hard, but the bounds seemed a bit tight to me. I was able to get my solution to pass in practice, but with 1.987s (your solution seems to take 1.2s). I had spent most of the round trying to constant factor optimize it, but failed to get it to pass during the round.

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

      For sure it wasn't my intention to require a lot of constant optimizing, so I'm sorry for that.

      How did you check that my solution takes 1.2s? In MPSQAS (their software for preparing problems) I have 0.56s on max tests, and I always thought solutions are run on the same server. If not, this is an extremely important issue in general.

      Also, I've written a wrong name in my post above. Now it's correct — the second place went to sunset. Sorry and congratulations!

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

        I scopied your code into the practice room and ran systests there. I remember there was some issue about timing before so I’m not sure if this is related or if it had been fixed.

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

    I had a slightly different (and unfortunately more complex-to-implement) approach to the 900. I definitely found it harder than the 500.

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

    I've read your explanation on Div1 hard but it's very hard to understand. Can you proof why the EV when you fix one bear and one human is the answer? Thank you a lot :)

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

When I ran my code on Example 0 for Div2 500 twice consecutively, the difference in execution time was 374ms (Run 1: 1234ms, Run 2: 1608ms). In System Tests, does Topcoder run submissions multiple times and take the minimum execution time into account?

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

    Probably it's not an option because of nondeterministic solutions. Considering an average time seems to be much better though.