Zlobober's blog

Yandex.Algorithm 2017 Qualification Round
By Zlobober, 7 years ago, translation, In English

Hi,

Midnight tonight (UTC +3) starts the Yandex.Algorithm 2017 Qualification Round. Round lasts for two days in a virtual mode. The contest itself is 100 minutes long. You may start your participation in any moment of time between 21:00 UTC of Friday and 20:59 UTC of Sunday, inclusive.

In order to participate in a competition, you have to complete your registration. It will remain open for everybody until the end of the qualification round.

Those who already successfully submitted at least one problem in a warm-up round are already qualified to the elimination round of the competition. For everybody else in order to be qualified it is necessary to successfully submit at least one problem in a qualification round.

The link to the contest will appear on the site of a competition shortly before the round start time.

Enter the contest!

Let us remind you that discussion of problem statements and solutions is prohibited until 22:40 UTC of Sunday (the latest possible contest end time for a participant). After that you may discuss problems and solutions in comments of this post or the editorial that will appear after the end of competition.

Good luck!

UPD: There is about 6 hours left to register and participate. Don't miss!

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

Comments Comments (25)
| Write comment?
»
7 years ago, # |
  Vote: I like it -133 Vote: I do not like it

Why someone submits more than one problem? It is not necessarily!

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

    Why are you doing CP? It is not necessary!

    I like doing contests. That is why I submit more than one problem.

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

      I find CP really fun when doing it in light-mode. But doing it serious -- like five hours contests and multiple consecutive submissions without resting -- is not worthing. Of course it is right for me, not necessarily for other people. And I am curious to know, where lies the source of such a great motivation. How are you not losing your passion during years?

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

        It is not about motivation. I'm having fun.

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

    Putting yourself up for the challenge even when there's no reward for it, is what makes you a better Competitive Programmer!

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

      I agree that putting yourself to a CHALLENGE makes better. But I do not agree that EVERYONE who submitted two or more problems was challenged by those problems. Probably those problems were easy for them and there was NO challenge. Yeah I want to made my contribution counter minus infinity.

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

        Not really, some problems were interesting to me and I found some cool ideas in some of the problems. Even solving problems that aren't much hard for you is good to get you used for solving problems fast.

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

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

      When I saw that all of my posts have really negative rating I thought maybe I need change some of my opinions. Then I reflexied for several hours about sport, about technologies, about learning and about why people so differ in their interests. I have slightly changed. But I can't say I know the answers. Too complex questions.

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

1- Can I register not virtually ?

2- How many problems I must solve to be qualified to the next round ?

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

    1- No. Virtual participation is official participation. It just means you can start your contest window of 1 hour and 40 minutes whenever you want before Sunday 20:59 UTC.
    2- One.

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

      Thanks a lot =D

      UPD: My questions is maybe naive that's why I got downVotes but what's wrong with "Thanks a lot =D" ?!!

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

any hint for problem E Cluster Connection? I tried brute force, and found this sequence: 6, 85, 900, 9450, .. but couldn't find any relation.

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

    Please wait 1 more hour! The contest hasn't ended for those who started their contest window after 20 UTC.

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

    There are two forms of graph:

    1. Two vertices and three arcs connect between them.
    2. Two circles share a common vertex.
    → Reply
    • »
      »
      »
      7 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      "Two vertices and three arcs connect between them."

      Do you mean two circles share a common edge?

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

        No, It is a special case.

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

          I don't get it, Could you elaborate more?

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

            Two circles share a common edge is a special case when a arc is an edge. This edge can become a arc when adding vetices.

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

        Editorial has been posted.

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

What's the difference between + and tick in the standings? Also can someone explain the difference between open and blind submission? Why would I resubmit after passing anyway?

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

    Rules say:

    Before submitting a solution to each problem for the first time, the contestant has to choose whether he or she wants to make the submission “open” or “blind”. This decision cannot be changed later. Results will be shown to the contestant immediately after a submitted solution has been tested.

    After making an “open” submission, the contestant is informed whether his or her solution is accepted. If it is not, the contestant is also told the type of error and the index number of the failed test case.

    Solutions that are “blind” submissions are tested on the sample test cases only (from the problem statement). If a solution doesn’t pass these test cases correctly, the contestant is told the type of error and the number of failed test case. If it does pass, the problem is considered to be preliminarily solved. Submitting further solutions to this problem becomes impossible. The final result of testing is announced after the end of the contest.

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

    Tick — successful blind submission, plus — open one. Blind submission is more profitable, because penalty is another. There are formulas in "Rules".

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

Please give some hints (only hints) for Artihmetic Mean Encoding (D) and Cluster Connection (E).

→ Reply