Osijek Competitive Programming Camp, Winter 2023, Day 9: Magical Story of LaLa (The 1st Universal Cup. Stage 14: Ranoa)
10 problems from Osijek Competitive Programming Camp, Winter 2023, Day 9: Magical Story of LaLa (The 1st Universal Cup. Stage 14: Ranoa) (contest 104334), difficulty -. 10/10 solutions verified against sample I/O.
Osijek Competitive Programming Camp, Winter 2023, Day 9: Magical Story of LaLa (The 1st Universal Cup. Stage 14: Ranoa)
Special | 10 problems | 10/10 verified | Difficulty - | 9m 43s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | LaLa and Magic Circle (LiLi Version) | 1m 4s | ✓ | |||
| B | LaLa and Magic Circle (LaLa Version) | 52s | ✓ | |||
| C | LaLa and Lamp | 1m 24s | ✓ | |||
| D | LaLa and Magic Stone | 58s | ✓ | |||
| E | LaLa and Monster Hunting (Part 1) | 54s | ✓ | |||
| F | LaLa and Monster Hunting (Part 2) | 51s | ✓ | |||
| G | LaLa and Divination Magic | 52s | ✓ | |||
| H | LaLa and Harvesting | 56s | ✓ | |||
| I | LaLa and Spirit Summoning | 1m | ✓ | |||
| J | LaLa and Magical Beast Summoning | 52s | ✓ |
CF 104334J - LaLa and Magical Beast Summoning
We are given an array of magical “cells”, each cell described by three numbers that behave like parameters of a structured object.
CF 104334I - LaLa and Spirit Summoning
We are given a system of points in the plane, where each point is a joint and each connection between two joints is a bar whose length is fixed once chosen. Each bar also has a color, and among bars of the same color we are only allowed to keep at most one.
CF 104334H - LaLa and Harvesting
We are given a graph whose structure is not arbitrary but built in three layers, each adding constraints that ultimately do not affect the core decision problem. Each vertex has a weight, interpreted as the tastiness of harvesting that vertex.
CF 104334G - LaLa and Divination Magic
We are given a collection of binary strings, each of length $M$, and each string represents a full assignment of outcomes for $M$ events. In one interpretation, the $j$-th bit being 1 means event $Ej$ is in “salvation”, and 0 means “catastrophe”.
CF 104334F - LaLa and Monster Hunting (Part 2)
We are given a large undirected simple graph $H$ with up to $10^5$ vertices and edges. Alongside it, there is a fixed “pattern” graph $G$ with 6 vertices (the exact structure is implicit in the statement; what matters is that it is a fixed labeled graph with 6 nodes and a…
CF 104334E - LaLa and Monster Hunting (Part 1)
We are given a collection of points in the plane, each equipped with a non-negative radius. Each point defines a closed disk.
CF 104334D - LaLa and Magic Stone
We are given an $N times M$ grid of cells. Each cell is either usable or forbidden. Usable cells must be completely partitioned into identical pieces, where each piece is a fixed polyomino consisting of 7 cells arranged in a U-like shape.
CF 104334C - LaLa and Lamp
The lamp forms a triangular array of cells. Row i contains i + 1 bulbs, and each bulb is either on or off. The goal is to make every bulb off using a specific operation.
CF 104334A - LaLa and Magic Circle (LiLi Version)
The task is purely constructive. We are not asked to compute an answer from an input; instead, we must output a complete description of a polygon and a long sequence of operations applied to it.
CF 104334B - LaLa and Magic Circle (LaLa Version)
We are given a simple polygon described by its vertices in counterclockwise order. The polygon is not necessarily convex.