UNICAMP Selection Contest 2023

#	Problem	Time	✓
A	Sum of Odds	51s	✓
B	Potato War 1	51s	✓
C	Sales	1m 17s	✓
D	Skywars	57s	✓
E	Potato War 2	1m 9s	✓
F	Vacation	1m	✓
G	Beautiful Crown	54s	✓
H	Team Division	57s	✓
I	Username	2m 8s	✓
J	The Final Reckoning	1m 9s	✓
K	Optimism	49s	✓
L	Experiment F129	50s	✓

Practice › Codeforces Solutions › UNICAMP Selection Contest 2023 ›

CF 104518L - Experiment F129

We are given a collection of segments on a number line, each segment representing an interval $[li, ri]$. From these intervals, we want to choose as many as possible such that all chosen intervals share at least one common point.

Practice › Codeforces Solutions › UNICAMP Selection Contest 2023 ›

CF 104518I - Username

We are given a sequence of monthly sales values and a fixed window size $K$. For every contiguous segment of length $K$, we compute its average sales. Since all windows have the same length, comparing averages is equivalent to comparing sums.

Practice › Codeforces Solutions › UNICAMP Selection Contest 2023 ›

CF 104518J - The Final Reckoning

We are given a sequence of 2N coin values arranged in a line. Two players alternately remove exactly one coin per move, choosing either the leftmost or rightmost remaining coin. Technoblade moves first, Skeppy moves second, and they continue until all coins are taken.

Practice › Codeforces Solutions › UNICAMP Selection Contest 2023 ›

CF 104518K - Optimism

We are maintaining an array of values over time, where each position represents a plot of land. The array changes through range updates that add a value to all elements in a segment.

Practice › Codeforces Solutions › UNICAMP Selection Contest 2023 ›

CF 104518H - Team Division

We are given a circular arrangement of $n$ players, each player belongs to some country $pi$. The circle means that player $1$ is adjacent to player $n$, and otherwise adjacency follows the natural order.

Practice › Codeforces Solutions › UNICAMP Selection Contest 2023 ›

CF 104518G - Beautiful Crown

We are counting colorings of a circular structure. For a fixed length $K$, imagine $K$ positions arranged in a ring. Each position receives one of $M$ jewel types, and two jewels of different types are always distinguishable while identical types are indistinguishable.

Practice › Codeforces Solutions › UNICAMP Selection Contest 2023 ›

CF 104518F - Vacation

We are given a sequence of monthly sales values and a fixed window size $K$. For every contiguous segment of length $K$, we compute its average sales. Since all windows have the same length, comparing averages is equivalent to comparing sums.

Practice › Codeforces Solutions › UNICAMP Selection Contest 2023 ›

CF 104518E - Potato War 2

We are asked to count how many different purchase plans achieve an exact total number of potatoes, where each store sells fixed-size packages. For store i, every package contributes bi potatoes, and we choose a nonnegative number of packages from each store.

Practice › Codeforces Solutions › UNICAMP Selection Contest 2023 ›

CF 104518D - Skywars

We are given a grid that represents a Skywars map. Some cells already contain terrain blocks, some are empty, and exactly one cell marks Techno’s position while exactly two cells mark enemy positions.

Practice › Codeforces Solutions › UNICAMP Selection Contest 2023 ›

CF 104518C - Sales

We are given a sequence of monthly sales values and a fixed window size $K$. For every contiguous segment of length $K$, we compute its average sales. Since all windows have the same length, comparing averages is equivalent to comparing sums.

Practice › Codeforces Solutions › UNICAMP Selection Contest 2023 ›

CF 104518A - Sum of Odds

We are given a single integer $n$, and we are asked to compute the sum of the first $n$ odd numbers. In other words, we conceptually build a sequence starting from 1, increasing by 2 each time, and stopping after $n$ terms. The task is to return the total of that sequence.

Practice › Codeforces Solutions › UNICAMP Selection Contest 2023 ›

CF 104518B - Potato War 1

Two players each start with a fixed number of potatoes and then grow more potatoes at a constant daily rate. Technoblade starts with $X1$ potatoes and gains $Y1$ potatoes per day. His rival starts with $X2$ potatoes and gains $Y2$ potatoes per day.