European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred)
11 problems from European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) (contest 1949), difficulty 1500-3300. 4/11 solutions verified against sample I/O.
European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred)
ICPC/IOI | 11 problems | 4/11 verified | Difficulty 1500-3300 | 26m 7s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Grove | 3300 | brute-force, dfs-and-similar, dp | 203 | 2m 41s | ✓ |
| B | Charming Meals | 1500 | binary-search, brute-force, greedy | 4,896 | 1m 44s | ✓ |
| C | Annual Ants' Gathering | 1900 | dfs-and-similar, dp, greedy | 2,526 | 4m 48s | ✓ |
| D | Funny or Scary? | 2600 | constructive-algorithms | 553 | 1m 10s | |
| E | Damage per Second | 2900 | brute-force, math | 146 | 1m 7s | |
| F | Dating | 2200 | greedy, sortings, trees | 1,408 | 1m 57s | |
| G | Scooter | 2300 | graphs, greedy | 1,041 | 3m 15s | |
| H | Division Avoidance | 3100 | greedy, math | 165 | 5m 53s | |
| I | Disks | 2,755 | ||||
| J | Amanda the Amoeba | 2600 | graphs, implementation, trees | 536 | 1m 3s | |
| K | Make Triangle | 2800 | constructive-algorithms, math | 449 | 2m 29s | ✓ |
CF 1949A - Grove
Every tree is planted at an integer lattice point. Around that point we place a disk of radius r, representing the root system. Two conditions must hold. The entire disk must stay inside the square lawn.
CF 1949B - Charming Meals
We have two arrays of size n. The array a contains the spiciness values of the appetizers, and the array b contains the spiciness values of the main dishes. Every appetizer must be paired with exactly one main dish, and every main dish must be used exactly once.
CF 1949C - Annual Ants' Gathering
Each vertex of the tree initially contains exactly one ant. A move chooses an edge $(u,v)$ and orders all ants currently gathered at $u$ to move to $v$. The ants obey only when the destination already contains at least as many ants as the source.
CF 1949D - Funny or Scary?
We are given a set of $n$ game scenarios, each of which must be played exactly once by the player. Between any two different scenarios $i$ and $j$, the game has a transition video that can be either funny (F) or scary (S).
CF 1949E - Damage per Second
We are asked to distribute a fixed number of skill points between two attributes: damage per hit and hits per second, in order to minimize the total time to kill a sequence of monsters.
CF 1949F - Dating
Each user can be viewed as a set of activities. We need to find two users whose sets satisfy three conditions simultaneously: 1. They share at least one activity. 2. The first user has at least one activity that the second user does not have. 3.
CF 1949G - Scooter
Each building has two independent pieces of information. The first string describes what class is held there. A building may need a mathematics professor, a computer science professor, or no professor at all. The second string describes which professor is initially located there.
CF 1949H - Division Avoidance
The process starts with a single cell at (0, 0). Whenever we divide a cell (x, y), that cell disappears and produces (x + 1, y) and (x, y + 1). A division is only legal if neither child is currently present. We are given a finite set of forbidden coordinates.
CF 1949J - Amanda the Amoeba
We are asked to guide Amanda the Amoeba from an initial configuration to a target configuration on a rectangular grid. Each configuration marks Amanda's body with , free pixels with ., and blocked pixels with X. Her body is connected and contains at least two pixels.
CF 1949K - Make Triangle
We are given a multiset of positive integers and three required group sizes. Every number must belong to exactly one of the three groups, and each group must contain exactly the requested number of elements. After splitting the numbers, we look only at the three group sums.