UTPC Contest 11-03-23 Div. 1 (Advanced)

8 problems from UTPC Contest 11-03-23 Div. 1 (Advanced) (contest 104764), difficulty -. 0/8 solutions verified against sample I/O.

8 items

UTPC Contest 11-03-23 Div. 1 (Advanced)

Div. 1 | 8 problems | 0/8 verified | Difficulty - | 9m 54s

# Problem Rating Tags Accepted Time ✓
C An Odd Meal 1m 25s
D Jelly Swarm 1m 2s
E Seacave Jellyfish 1m 28s
F Seaside Shopping 1m 22s
G Genome Splicing 1m 27s
H Jellyfish Sequence 1m 42s
I Deep Sea Navigation 49s
J Seaside Streaming 39s
Practice › Codeforces Solutions › UTPC Contest 11-03-23 Div. 1 (Advanced) ›

CF 104764J - Seaside Streaming

I can absolutely write that editorial, but I can't produce a correct solution from the information you've pasted because the problem statement has been corrupted.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 11-03-23 Div. 1 (Advanced) ›

CF 104764F - Seaside Shopping

We are given a set of up to 100 items. Each item is available on some subset of 10 days, described by a 0-1 matrix. On each of the 10 days, we decide whether Yolanda visits the shop or not, so a valid strategy is simply a subset of days.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 11-03-23 Div. 1 (Advanced) ›

CF 104764G - Genome Splicing

We are given a target genome string over the alphabet {A, T, C, G}. We are also given a set of DNA segments, each of which can be reused arbitrarily many times. The task is to determine the smallest number of segments whose concatenation forms the genome exactly.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 11-03-23 Div. 1 (Advanced) ›

CF 104764I - Deep Sea Navigation

I can absolutely write this editorial, but I cannot correctly derive the algorithm from the problem statement alone. The statement is missing a crucial detail needed to determine the graph that must be searched: When using one battery of power x, are you allowed to: 1.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 11-03-23 Div. 1 (Advanced) ›

CF 104764E - Seacave Jellyfish

We are given a weighted tree with up to 100 nodes. Each node represents a seacave and contains some amount of jellyfish, represented by a nonnegative value.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 11-03-23 Div. 1 (Advanced) ›

CF 104764C - An Odd Meal

We are given a sequence of integers representing how many jellyfish are eaten each minute over a fixed lunch period.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 11-03-23 Div. 1 (Advanced) ›

CF 104764D - Jelly Swarm

We are given a set of distinct integer positions on a line, each representing a jellyfish. From these positions we must choose exactly $K$ of them and consider only those chosen points.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 11-03-23 Div. 1 (Advanced) ›

CF 104764H - Jellyfish Sequence

We are given a sequence of jellyfish, each associated with a positive integer representing its number of tentacles. The first jellyfish starts with a given value $a1$.
codeforces competitive-programming Jun 28, 2026