snarknews's blog

Yandex.Algorithm Finals online in Sunday, Aug 3 19:00 Moscow time
By snarknews, 10 years ago, In English

We are planning to run Yandex.Algorithm finals for online contestants at Sunday, Aug 3 2014 at 19:00. Onsite contestants, please do not discuss Yandex.Algorithm problems at the open boards till the online round end time (20:40 Moscow Time). Problems will be reordered.

Contest entry and link to registration:

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

»
10 years ago, # |
  Vote: I like it +5 Vote: I do not like it

Problems will be reordered

Will onsite participants be visible in scoreboard? If yes, does it mean that I can know the order of problems after few onsite contestants submissions?

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

    This situation is already under consideration. Probably we will do not add onsite contestants' results.

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

In my opinion, 1:40 is a little bit short for the final round. My reasoning is that people that can solve 5 problems in, say, 2:30, are better and should be rated higher than those who can solve 4 in 1:40 and run out of ideas.

That aside, the problems were great, thanks for the contest!

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

    Well, programming competitions are always about speed. Usually, everyone can solve all the problems given sufficiently enough time.

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

      Ha, yeah. Guess there's little place in competitive programming for slowpokes like me. Takes too long to come up with the idea for a hard problem and in short competitions I almost always end up solving one extra problem just 5-10 minutes after the end of the contest.

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

        Then you should have better chances in ACM ICPC or individual contests with longer duration (like GCJ and FHC). I think it is great to have such variety of contests nowadays — everyone can show his strong sides somewhere. Someone like thinking and solving hard problems, working with them for hours or even days, other guys prefer typing:)

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

How to solve problem Dice without writing a lot of code?

P. S. I like problem "1024 Stack Edition", just easy dynamic programming :)

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

    Put a cube at the hexomino, so down face and hexomino cell will be enumerated by same number. Then just try to roll cube along the hexomino so down face will have same number as current cell. If all 6 cells visited — answer is Yes. Else try to rotate cube 4 times and to swap numbers, related to one pair of opposide sides (because we can fold the hexomino in two directions, both cube orientations are legal) and repeat the procedure. After it all ends up unsuccessfully, answer No.

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

      no where it was written that the paper can be fold in both sides. after getting wa i changed this without hope and it turned into ac :(

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

        There was no limitation on the directions of folding, so both can be used. Why do you think that any "preferred" direction is selected? Usually paper can be fold in two sides...

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

          yah i know. i did not mean to complain. but i personally dont like such hidden thingy :(

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

      LOL, this is an unusual situation where an unrated coder is helping a red coder. :D

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

First of all, what is the point of shuffling problems? Because if one will use scoreboard from finals to estimate problem difficulty, he can also get their original names (by just placing cursor on problem letter in scoreboard).

And second question, for all those who know C++ better than me:) What does nice(int x) do in C++? :) I failed problem D because of function with name nice — compare this (WA1) and this (AC) (only difference is in changing function name). I tried first source in CF run, on my PC and everywhere else outside Yandex.Contest — it works well; but on Yandex.Contest there is some nice(int x) in C++ that returns some value >0 for every x in range 1..60000:) And I can't find anything about it in any reference.

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

    It's in unistd.h.

    Upd. And the reason why on CF it's fine — because it's Unix-specific. What OS do you have on your PC? Did you try to submit it to, e.g., some ejudge-based system?

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

    Any of those PC's was running Linux? If yes, it may be some variable used in Linux libraries. If no, please report it in Yandex.Contest (sending bug report to system administrators).

    → Reply