adamant's blog

The 1st Universal Cup. Stage 7: Zaporizhzhia
By adamant, history, 20 months ago, In English

Hello everyone! The 7th Stage of the 1st Universal Cup: Zaporizhzhia, will be held on March 11th, 2023.

The contest is based on the Day 2: Oleksandr Kulkov Contest 3 from the Osijek Competitive Programming Camp 2023. Please, don't participate if you have seen these problems.

Authors of the problems: adamant, fedimser, I would also like to thank -is-this-fft- for the help with the preparation of the contest.

We hope you will like the problems!

You can participate in the contest in the following three time windows:

  • Mar 11th 13:00 — 18:00 (UTC +8)
  • Mar 11th 19:00 — 24:00 (UTC +8)
  • Mar 12th 02:00 — 07:00 (UTC +8)

Please note that you can see two scoreboards in DOMjudge. The 'Local Scoreboard' shows the standings ONLY IN THE CURRENT TIME WINDOW. And the 'Combined Scoreboard' shows all participants, including the onsite participants, and the cup participants in the previous time windows.

Contest link: https://domjudge.qoj.ac/

Universal Cup Scoreboard: https://qoj.ac/ucup/scoreboard

About Universal Cup:

Universal Cup is a non-profit organization dedicated to providing trainings for competitive programming teams. Up to now, there are more than 200 teams from all over the world registering for Universal Cup.

A more detailed introduction: https://codeforces.me/blog/entry/111672

Register a new team: https://ucup.ac/register

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

Comments Comments (10)
| Write comment?
»
20 months ago, # |
← Rev. 2   Vote: I like it +13 Vote: I do not like it

Best of luck !!

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

is it rated?

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

What are colored scores in the rating page? ucup.ac rating

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

I sent an email for registration yesterday evening, but I haven't received an answer yet. When will the answer come?

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

    Don't be worried. They will be processed before the contest. All applications (including the rejected ones) will be answered and get a reply.

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

Can somebody help me with the tutorial of "Problem H. Graph Isomorphism"?

tutorial

Additionally, is there a better thread/post to discuss university cup questions under?

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

    Jeroen wrote a detailed elementary proof here. Otherwise, one can prove through obscure group theoretic stuff that $$$S_n$$$ only has $$$A_n$$$ and $$$S_{n-1}$$$ as subgroups of index $$$\leq n$$$ for $$$n > 4$$$.

    → Reply