UTPC Contest 01-26-24 Div. 1 (Advanced)

8 problems from UTPC Contest 01-26-24 Div. 1 (Advanced) (contest 104931), difficulty -. 1/8 solutions verified against sample I/O.

8 items

UTPC Contest 01-26-24 Div. 1 (Advanced)

Div. 1 | 8 problems | 1/8 verified | Difficulty - | 12m 38s

# Problem Rating Tags Accepted Time ✓
C Gambler's Chocolate Cove 1m 13s
D The World Turned Upside Down 1m 9s
E Up Down Matching 4m 11s
F Down Up Disco 1m 22s
G Dinnerbone and Array 1m 16s
H Australian Solitaire 1m 3s ✓
I Pineapple Upside Down Cake 1m 20s
J Careful Cookout 1m 4s
Practice › Codeforces Solutions › UTPC Contest 01-26-24 Div. 1 (Advanced) ›

CF 104931J - Careful Cookout

We are placing shrimps on an $n times m$ grid, where each cell can either contain a shrimp or be empty. Each configuration is just a binary matrix. The grill has a rule that only activates locally on every $2 times 2$ subgrid.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 01-26-24 Div. 1 (Advanced) ›

CF 104931E - Up Down Matching

We are given multiple test cases. Each test case consists of a line of people standing in a row, where each person belongs to one of two groups, encoded as U or D.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 01-26-24 Div. 1 (Advanced) ›

CF 104931I - Pineapple Upside Down Cake

We are interacting with a hidden circular array of length $N$, where $1 le N le 2 cdot 10^5$. Each position on the circle contains an integer value, and these values are strictly increasing as we move around the circle in order: $s1 < s2 < dots < sN$.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 01-26-24 Div. 1 (Advanced) ›

CF 104931H - Australian Solitaire

We are counting sequences of length $N$ formed from a fixed set of card ranks. The ranks behave like a total order: Ace is the smallest, then 2 up to King. The key restriction is on how consecutive cards are allowed to change. The first card in the sequence can be any rank.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 01-26-24 Div. 1 (Advanced) ›

CF 104931F - Down Up Disco

The dance floor is a rectangular grid where each cell contains a person who is either in a normal orientation or flipped. We want to transform the entire grid into all zeros by applying a specific operation any number of times.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 01-26-24 Div. 1 (Advanced) ›

CF 104931G - Dinnerbone and Array

We are given a small array of integers for each test case. From this array we may choose any subset of elements, but we are explicitly forbidden from choosing the full array. The subset can even be empty.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 01-26-24 Div. 1 (Advanced) ›

CF 104931C - Gambler's Chocolate Cove

We are given several slot machines, each producing a random reward when pulled. Each machine has its own fixed probability distribution over a small set of possible reward values.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 01-26-24 Div. 1 (Advanced) ›

CF 104931D - The World Turned Upside Down

We are given a set of distinct target numbers. We start from the value 1 and are allowed to build a sequence by repeatedly multiplying the current value by any positive integer.
codeforces competitive-programming Jun 28, 2026