Betlista's blog

TopCoder Single Round Match 533
By Betlista, 13 years ago, In English

Hello coders,

next TC SRM 533 is scheduled on 02.18.2012 12:00 PM EST.

It's brought by Google.

Registration starts 3 hours before start and ends 5 minutes before start (be aware that even if coding phase starts at 12:05, registration ends at 11:55).

Also there is limit for number of participants (something like 2300 or so), but typically there is not so many coders (just in time of TCO, number of participants in SRMs increases over the limit).

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

»
13 years ago, # |
← Rev. 2   Vote: I like it +25 Vote: I do not like it

What is this guys ??? If this post would have been by a high rated coder or one who has high contribution , It would have got lot of + points , But just because a normal man posts this , gets -'s . Isn't this called hypocrisy .

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

    I think it is too early to notify about the competition.

    It may be that the author specially has written the post in order to increase his rating.

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

      My motivation was that while there are CF competitions on Friday (in my country) and on Monday, maybe someone would like to participate in TC SRM instead of one of these two if he/she has not so much time for competitions.

      TC notifications arrive just few hours (typically less than 24) before the contest and I think there is not enought time to manage time for it in some cases (especially when there are 3 contest in 4 days)...

      I also wanted to warn coders, that 12:00 PM EST is the time when there is the most coders participating and I quess that for SRM brought by Google it will be even more (but maybe I'm wrong in that, we will see).

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

        Would you please explain how the "brought by Google" part could, or should, increase the number of participants?

        From what I know, "SRM brought by X" just means that authors and testers for this particular round are paid by X, not by TopCoder. A chat session with X representatives may also be scheduled one hour before the SRM. While the participants are usually grateful for that, it's no more, no less. The authors are not necessarily X employees, the problems have nothing to do with X, you can not win money or a trip to X headquarters... nothing more unless stated otherwise.

        Is something different this time?

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

          I wrote that it's my quess, I'm not sure about it...

          When there are SRMs brought by Intel, there is chat room where you can ask questions and also some job opportunities were presented. As Google always attracts attention, my assumption was that there could be a lot of coders interested in SRM. It's difficult to predict how many coders will be there, For example I wasn't able to register to SRM 512 because of limit — fact that 512 = 2^9 attracted so many coders.

          We will see soon ;-)

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

          Now we know, that limit for the contest was reached — 2450 participants.

          I'm not 100% sure that the Google sponsorship is the reason, but my guess was correct in this case :-)

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

    I think the color is not matter. But it is to early for such post, there is more than 3 days before the SRM.

    → Reply
    • »
      »
      »
      13 years ago, # ^ |
      ← Rev. 2   Vote: I like it -8 Vote: I do not like it

      But the purpose of the guy might be to tell that this srm is brought by google.

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

    Maby you mean "low skilled" but high rated coders are normal too. The guys who do it are offered by the whole world.

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

    They just don't like google ;) Also, there are people who love -'s.

    Forget it, contribution is not important, a good post is more valuable for people than all of these contribution ratings.

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

What was the broadcast message? I accidentaly closed it :-(

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

I tried to use a greedy approach in Div1-1000. We build the code tree using a such way: we start with the root with 2-letter syllable, then, iteratively, first, we take a leaf with the least length from the root, second, if we have 1 leaf less than needed we add to the chosen leaf two 2-letter children, otherwise we add to the chosen leaf three children: two 2-letter and one 3-letter. So the code tree is determined in a such way and we assign leafs with the least length to the most frequent words. Then the answer is calculated obviously. Is this solution wrong?

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

    Yes, consider any case with big differences in frequencies (like 100 1 1 1 1 1 1 1 1 1 1 1 1). We may have to build a very deep tree to minimize the length of very frequent words. We might even need to build a very deep "chu"-branch (for example, we can have a word "chu"x10 in optimal solution).

    → Reply