XIII UnB Contest Mirror

14 problems from XIII UnB Contest Mirror (contest 106159), difficulty -. 14/14 solutions verified against sample I/O.

14 items

XIII UnB Contest Mirror

Special | 14 problems | 14/14 verified | Difficulty - | 12m 5s

#	Problem	Time	✓
A	Analyzing the Race	56s	✓
B	Bauru	48s	✓
C	Creating a Playlist	41s	✓
D	Djqifs Tijgu	46s	✓
E	Elementary Data Structure Problem	46s	✓
F	Falatro	51s	✓
G	Gelatos from Goi\u00e1s	1m 7s	✓
H	Hardcore Aura Farming	1m 14s	✓
I	Ivo saw the UVa	40s	✓
J	Jolly Game Night	41s	✓
K	Kronos	50s	✓
L	Leveling Diamonds	45s	✓
M	Mapping Tactics	1m 8s	✓
N	Nautic Issue	52s	✓

Practice › Codeforces Solutions › XIII UnB Contest Mirror ›

CF 106159I - Ivo saw the UVa

We are given a rectangular grid of characters representing a board of letters. Each cell contains a single uppercase character. The task is to count how many times the pattern “UVA” appears in the grid when read along straight lines.

Practice › Codeforces Solutions › XIII UnB Contest Mirror ›

CF 106159C - Creating a Playlist

We are given a sequence of songs, each associated with a value that can be positive or negative. We want to select a subset of these songs to maximize the total sum of selected values, but there is a spacing restriction: if we choose a song at position i, then we are forbidden…

Practice › Codeforces Solutions › XIII UnB Contest Mirror ›

CF 106159N - Nautic Issue

We are given a motion process that starts from an unknown integer position $X$. From this starting point, a sequence of moves is executed.

Practice › Codeforces Solutions › XIII UnB Contest Mirror ›

CF 106159D - Djqifs Tijgu

We are given a long sequence of numbers, and a shorter pattern sequence. We are allowed to choose a single shift value between 0 and 9999. Applying this shift means adding it to every element of the long sequence and taking everything modulo 10000.

Practice › Codeforces Solutions › XIII UnB Contest Mirror ›

CF 106159K - Kronos

We are given a collection of timestamps representing when messages arrived from the future. Each timestamp is just a single integer on a very large number line.

Practice › Codeforces Solutions › XIII UnB Contest Mirror ›

CF 106159G - Gelatos from Goiás

We are given a collection of ingredients, each with a numerical quality score. We want to choose a subset of these ingredients to maximize a specific score function.

Practice › Codeforces Solutions › XIII UnB Contest Mirror ›

CF 106159M - Mapping Tactics

We are given several simple convex polygons drawn on a plane, with the special property that any two polygons either do not touch at all or one lies completely inside the other. There is no partial overlap and no edge crossings between different polygons.

Practice › Codeforces Solutions › XIII UnB Contest Mirror ›

CF 106159L - Leveling Diamonds

We are asked to compute how many diamond blocks are needed to construct a stepped pyramid of height $N$. The structure is layered: level $i$ (starting from 1 at the top) is a square whose side length is $2i+1$, so it contains $(2i+1)^2$ blocks.

Practice › Codeforces Solutions › XIII UnB Contest Mirror ›

CF 106159H - Hardcore Aura Farming

We are given a tree of size $N$, where each node represents a game. Each game $j$ comes with a range of followers $[Lj, Rj]$ and a value $Kj$. If a follower $k$ plays game $j$, they gain $Kj$ aura.

Practice › Codeforces Solutions › XIII UnB Contest Mirror ›

CF 106159J - Jolly Game Night

We are given a rectangular grid with $N$ rows and $M$ columns, initially completely empty. Two players alternate turns. Wilson always plays first, and on his move he marks any currently empty cell with a W. Pedro responds on his move by marking any empty cell with a P.

Practice › Codeforces Solutions › XIII UnB Contest Mirror ›

CF 106159F - Falatro

We are given an undirected graph where vertices represent cards and edges represent mutual trust relationships between pairs of cards.

Practice › Codeforces Solutions › XIII UnB Contest Mirror ›

CF 106159E - Elementary Data Structure Problem

We are maintaining a growing collection of stacks, where both the number of stacks and their contents evolve over time. Initially there are no stacks. The system processes a sequence of operations in order. One operation creates a new empty stack and appends it to the end.

Practice › Codeforces Solutions › XIII UnB Contest Mirror ›

CF 106159A - Analyzing the Race

We are given a long race consisting of n laps, where each lap has exactly one winner among 26 possible drivers, labeled by lowercase English letters. So a full race is simply a string of length n over an alphabet of size 26.

Practice › Codeforces Solutions › XIII UnB Contest Mirror ›

CF 106159B - Bauru

We are given a single numeric string that represents two concatenated integers, A and B. These two numbers originally come from an address format where A and B are separate components, but in the message they have been glued together without any delimiter.