2023-2024 ICPC Southwestern European Regional Contest (SWERC 2023)
13 problems from 2023-2024 ICPC Southwestern European Regional Contest (SWERC 2023) (contest 104945), difficulty -. 3/13 solutions verified against sample I/O.
2023-2024 ICPC Southwestern European Regional Contest (SWERC 2023)
ICPC/IOI | 13 problems | 3/13 verified | Difficulty - | 18m 15s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Card game | 1m 18s | ||||
| B | Supporting everyone | 1m 8s | ✓ | |||
| C | Metro quiz | 1m 42s | ||||
| D | Flag performance | 2m 8s | ||||
| E | Nicest view | 1m 24s | ||||
| F | Programming-trampoline-athlon! | 1m 6s | ||||
| G | Favourite dish | 1m 18s | ||||
| H | Break a leg! | 1m 31s | ||||
| I | Throwing dice | 1m 3s | ✓ | |||
| J | Olympic goodies | 22s | ||||
| K | Team selection | 59s | ✓ | |||
| L | Broken trophy | 1m 43s | ||||
| M | In-order | 2m 33s |
CF 104945M - In-order
We are given a binary tree over the numbers from 1 to N, but the tree structure is not explicitly provided. Instead, we are told three traversal descriptions.
CF 104945L - Broken trophy
We are given a collection of rectangular tiles, each tile having an integer side lengths $Ak times Bk$ where both sides are at most 3, and the tile may be rotated. All tiles together have total area exactly $3N$.
CF 104945K - Team selection
We are simulating a selection process over a dynamic set of players labeled from 1 to N. Initially all players are available. Two leaders alternate turns.
CF 104945H - Break a leg!
We are given the vertices of a simple non-self-intersecting polygon in order. Think of it as a rigid flat tabletop whose mass is uniformly distributed across its area.
CF 104945J - Olympic goodies
Codeforces 104945J: Olympic goodies
CF 104945I - Throwing dice
Each player rolls multiple independent dice, and the final score is the sum of all face values shown by their dice. Every die is fair, but different dice may have different numbers of sides, so each die contributes a uniform integer in a different range.
CF 104945G - Favourite dish
Each dish comes with two attributes: a taste score and a plating score. Each person also comes with two preferences, which act as weights for those same two attributes.
CF 104945E - Nicest view
We are given a sequence of heights along a straight hiking trail. Each index represents a milestone placed at equal horizontal spacing, and each milestone has a distinct altitude.
CF 104945D - Flag performance
We start with a permutation of size $N$, where person $i$ initially holds a flag of some color $pi$. A move consists of choosing any two positions and swapping the flags they hold.
CF 104945F - Programming-trampoline-athlon!
Each team in this competition is described by a name, a count of solved programming problems, and six scores coming from trampoline exercises. The final result of a team is a single total score formed by combining two independent parts.
CF 104945C - Metro quiz
We are given a collection of metro lines, where each line can be seen as a subset of stations from a fixed universe of size up to 18. A line is fully described by which stations it stops at.
CF 104945A - Card game
We are given a sequence of cards held in a hand. Each card has a suit among five types, ordered by priority as silver, white, emerald, red, and cyan, and each card also has a numeric label within its suit.
CF 104945B - Supporting everyone
Each country can be represented in one of two ways. Either Alice prepares a full flag drawing, which requires buying all the colors that appear in that country's flag, or she avoids drawing that flag entirely and instead uses a single pin for that country.