Yandex's blog

Yandex Cup 2023
By Yandex, history, 13 months ago, translation, In English

Hi everyone,

You’re invited to participate in Yandex Cup 2023, a programming competition run by Yandex.

Our newest addition is the Algorithm track. It's a great opportunity to solve problems, compete with people from around the globe, and win cash prizes.

If you're already tired of Olympiad programming problems or just looking for variety, you might want to take a closer look at the other tracks:

We updated the Machine Learning track. It will be Kaggle-styled and include three subcategories: recommendation systems, language models, and nowcasting. You'll have three weeks to complete the tasks. Prizes will be awarded to the strongest competitors in each category:

  • 1st place — 500,000 rub
  • 2nd place — 250,000 rub
  • 3rd place — 200,000 rub
  • 4th place — 150,000 rub
  • 5th place — 100,000 rub

The award policies for the Mobile Development and Machine Learning tracks are different. You can find them on the track pages.

We’re also giving T-shirts to the top 20 finalists in each track.

Schedule:

  • The qualifying round starts on October 23 at 12:00 (GMT+3) and ends on October 29 at 23:59 (GMT+3).
  • The semi-finals take place on November 4 at 12:00 (GMT+3).
  • The finals are held on December 2-3 in Almaty. The time will be announced later. The top 20 participants from each track's semifinals will advance to the finals, with Yandex covering the costs of participation.

The dates and stages for the Machine Learning and Mobile Development tracks are different. For more details, see the track pages.

Registration will remain open until the end of the qualifying round. To learn more and register, go to: yandex.ru/cup/.

Finally, we’d like to express a special word of gratitude to the entire development team and the track team leader Sasha Minakov elshiko.

See you at Yandex Cup!

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

»
13 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been translated by Yandex (original revision, translated revision, compare)

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

How do I join the qualifying round of the algorithm track? I've already registered, but I can't find a way to start the contest.

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

"This track is only available in Russian"

→ Reply
»
13 months ago, # |
← Rev. 2   Vote: I like it +49 Vote: I do not like it

What is the advancing criteria from Algo Qualifying round?

https://yandex.com/cup/algorithm/

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

Not able to register via my google account.
It says "The service was unable to process the request. Refresh the page and try again."

→ Reply
»
13 months ago, # |
← Rev. 2   Vote: I like it +3 Vote: I do not like it

How to solve D

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

    I did not solve this problem in contest but here is what i think is the correct solution.

    First of all, let's try to reason about given constraints in terms of prefix sums. You also should note that since any song can have any mood, any prefix sum array can be constructed.

    Let a be the array of the song moods.

    Then sum(a[l..r]) <= x is equivalent to p[r] — p[l — 1] <= x, where p[i] is the sum(a[1..r]).

    Also consider that you can rewrite ">=" constraint in terms of "<=", so:

    p[l — 1] — p[r] <= -x

    Okay, what's next? It looks like directed weighted graph problem now, where there's either an edge (l-1; ? with weight x ("<=" case), or edge (r; l-1) with weight -x (">=" case). But how does that help?

    You should notice that we can even think about putting a "No" as the answer only when there's a cycle in the graph. Moreover, if you see that this cycle is of negative weight, this will lead to a "No" answer, since in the end some p[i] has to be smaller than you started with every time you go through the negative cycle.

    So the problem is reduced to find if there's a negative weight cycle, which can be done with Bellman-Ford algorithm in $$$O(NM)$$$

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

When will the results of Qualification Round be announced?

→ Reply
»
13 months ago, # |
← Rev. 2   Vote: I like it +46 Vote: I do not like it

Will there be a public scoreboard of the qualification round?

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

Is there anyone who has a checkmark to "Advance to Semi-finals" on profile page? It would be sad if we were eliminated without the criteria for advancing to the semi-finals being revealed.

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

    I've got a checkmark on a mobile track, but not algorithms. What's interesting is that you can only choose one track for semi-finals. And the mobile track semi-finals has already started. So while I'm waiting for the results to make a decision — I'm wasting my time if I stick to a mobile track.

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

    I have asked about the criteria for qualification during contest, and here is their response: "Hello! We will publish and send out the criteria for the next stage after the end of the contest within two or three days."

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

    UPD:got a checkmark.

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

      Thank you very much. I almost didn't see this checkmark.

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

I believe everyone can see the results in the profile now. I'm surprised that ABC is not enough to qualify. Looks like this year threshold is higher.

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

    Yeah would have been better if they would have told about percentage or number of people to qualify. I surely thought qualification is basic check and ABC should be enough

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

    I advanced with ABCE. Looks like the criteria is somewhere between 3 and 4 problems. Looks like all problems have equal weights since the score is given as number of problems solved.

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

What does the verdict showed IG (ignore) mean?

→ Reply