Checklist ONIA 2026 Team Selection Camp (Extended Squad) – Test 1 · Task 2
The Legend of Algorel
Romanian title: Legenda lui Algorel
Assign each Codeforces problem statement to its main algorithmic category: dp, geometry, graphs, number theory or strings.
The task
A student's teacher asks him to recognise the essence of algorithmic problems rather than solve them. The contestant receives problems.csv, a selection of Codeforces problems with id, title, description, statement, input and output format, examples, time and memory limits and rating.
For each problem the contestant must output one main category from dp, geometry, graphs, number theory and strings; ambiguous problems were labelled by experienced problem setters. The statement does not describe any labelled training split.
Abridged and translated by SOTA from the official Romanian materials. The official statement has the exact rules, and it wins wherever this summary differs.
At a glance
- You get
problems.csv(598 problems, 10 columns; 1,610,612 bytes).- You submit
- CSV with id and label (e.g. PROBLEM_0001,strings).
- Scoring
- Macro F1 over the five categories: 0 points if below 0.7, 100 × Macro F1 for 0.7 ≤ Macro F1 < 0.95, 100 points at 0.95 or above.
- Rules
- On-site, Timișoara (West University of Timișoara and Politehnica University of Timișoara)
- No internet access; only preinstalled offline resources (NLTK, spaCy
en_core_web_sm, scikit-learn, Gensim glove-wiki-gigaword-50, fastText without pretrained models, and the Hugging Face models distilbert-base-uncased, MoritzLaurer DeBERTa-v3-large-mnli-fever-anli-ling-wanli, roberta-large-mnli, all-MiniLM-L6-v2 and whisper-small) - A GPU Jupyter environment hosted by UVT was provided during the tests
- Problem statements unlocked with a password handed out in the room
- Format
- ONIA 2026 Lot Lărgit, test 1, 23 May 2026.