darkkcyan's blog

[UNOFFICIAL] VNOI CUP 2026 — Round 2
By darkkcyan, history, 10 hours ago, In English

Hello Codeforces!

After an intense first qualification round, we are excited to invite everyone to participate in Round 2 of VNOI CUP 2026, taking place on Saturday, May 30!

This round continues the race toward the onsite Final Round of VNOI CUP 2026, where top contestants will compete for final standings and exclusive VNOI CUP merchandise.

If you are Vietnamese and eligible to participate in the official round, we strongly encourage you to register and compete there instead.

As announced previously, we also plan to invite several top international participants from the unofficial mirror rounds to attend the Final Round onsite in Vietnam and compete in the Open Division. If you are an international participant who has competed in at least one of the unofficial rounds and are interested in joining the Open Division of the Final Round onsite in Vietnam, please reach out to us directly — we will get in touch with the selected participants ahead of the Final Round. You can contact us via:

⚠️ Please note that invited Open Division participants will need to cover their own travel and accommodation expenses. However, VNOI will assist with hotel booking and logistics support whenever possible.

VNOI CUP is a Competitive Programming competition hosted by VNOI (Vietnam Olympiads in Informatics community), a group of Vietnamese programmers working together to make programming competitions more fun and challenging in Vietnam. We're a non-profit organization dedicated to supporting the growth of competitive programming in Vietnam, and this competition is one of the many ways we aim to achieve that goal.

A huge shoutout to all problem setters, testers, coordinators, and volunteers who contributed to this round. Thanks to their hard work, we are able to bring another exciting and challenging problem set to the community!

Setters: Kuroni, Namine, bachbeo2007, darkkcyan, hihihaha, huyhasun, i_love_huyhau6a2, xuanquang1999, vinfat

Testers: conqueror_of_tourist, awoo, shinchankosen, WataHata, Sayleyd, Fucking_Specialist

VNOI CUP 2026 will consist of two online qualification rounds followed by an onsite Final Round. The qualification rounds will each last 3 hours and feature 7 problems. Based on the results, the top Vietnamese contestants will advance to the Final Round, which is expected to be held onsite in July 2026.

  • Qualification Round 1: May 16, 2026 — 20:30 (GMT+7)
  • Qualification Round 2: May 30, 2026 — 20:30 (GMT+7)
  • Final Round (Onsite): July 23-24, 2026

As in previous years, the competition will be used with multiple subtasks with partial scoring, and penalty time based on incorrect submissions.

  • Scoring: Each problem includes several subtasks with different constraints and point values. You must pass all test cases in a subtask to earn its points.
  • Penalty Time: Equals the time of your last score-increasing submission for each problem, plus 5 minutes for each incorrect submission.
  • Ranking: Determined by total score (descending). Ties will be broken by lower total penalty time.

⚠️ Each participant must only use one VNOJ account. Anyone found using multiple accounts may be disqualified and banned from future contests.

⚠️ Please refrain from using AI assistance tools during the contest. Although the unofficial mirror round does not apply the same monitoring requirements as the official leaderboard, we kindly ask all participants to respect the spirit of fair competition.

🎁 VNOI CUP 2026 will feature exclusive VNOI CUP T-shirts awarded to outstanding Vietnamese participants across the qualification rounds.

⚔️ The competition is getting more exciting than ever. We hope you enjoy the contest and wish all participants the best of luck in Round 2!

🚀 See you in VNOI CUP 2026 — Round 2!

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

»
58 minutes ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by darkkcyan (previous revision, new revision, compare).

→ Reply