UTPC Contest 2-12-25 Div. 1 (Advanced)

8 problems from UTPC Contest 2-12-25 Div. 1 (Advanced) (contest 105710), difficulty -. 3/8 solutions verified against sample I/O.

8 items

UTPC Contest 2-12-25 Div. 1 (Advanced)

Div. 1 | 8 problems | 3/8 verified | Difficulty - | 5m 10s

#	Problem	Time	✓
C	Finchy Flying	51s	✓
D	Sample Collecting	26s
E	Finch Sanctuaries	30s
F	Birdwatching	59s	✓
G	Galapagos	25s
H	Lobotomy	1m 10s	✓
I	Palagapos	24s
J	Barnacle Game	25s

Practice › Codeforces Solutions › UTPC Contest 2-12-25 Div. 1 (Advanced) ›

CF 105710H - Lobotomy

We are given a network of neurons, where each neuron is a node and each synapse is an undirected connection between two neurons. Unlike a standard simple graph, multiple synapses can connect the same pair of neurons, and a synapse can even connect a neuron to itself.

Practice › Codeforces Solutions › UTPC Contest 2-12-25 Div. 1 (Advanced) ›

CF 105710J - Barnacle Game

Sure - I can do that. Please paste the full Codeforces problem statement (or at least the link / name + constraints). If there are multiple subtasks or samples, include those too.

Practice › Codeforces Solutions › UTPC Contest 2-12-25 Div. 1 (Advanced) ›

CF 105710E - Finch Sanctuaries

I don’t have the actual statement of Codeforces 105710E - Finch Sanctuaries in your prompt, and I can’t reconstruct a correct solution or editorial without knowing the rules of the problem (what the input represents, what needs to be computed, and constraints).

Practice › Codeforces Solutions › UTPC Contest 2-12-25 Div. 1 (Advanced) ›

CF 105710I - Palagapos

I can’t write a correct editorial for that problem yet because the statement is missing. “Codeforces 105710I - Palagapos” isn’t enough to reconstruct the task reliably, and guessing would produce a misleading explanation and likely an incorrect solution.

Practice › Codeforces Solutions › UTPC Contest 2-12-25 Div. 1 (Advanced) ›

CF 105710F - Birdwatching

There are two finite sets of points on a number line. One set represents bird positions, the other represents camera positions.

Practice › Codeforces Solutions › UTPC Contest 2-12-25 Div. 1 (Advanced) ›

CF 105710G - Galapagos

I can’t write a correct Codeforces editorial without the actual problem statement. “105710G - Galapagos” doesn’t provide enough information to reconstruct the task reliably, and guessing would very likely produce a wrong or misleading solution.

Practice › Codeforces Solutions › UTPC Contest 2-12-25 Div. 1 (Advanced) ›

CF 105710C - Finchy Flying

We are given a set of birds, each one starting from some horizontal position on a line and flying vertically upward to a peak height before coming straight back down to the same ground level. The complication is that wind layers exist at specific altitudes.

Practice › Codeforces Solutions › UTPC Contest 2-12-25 Div. 1 (Advanced) ›

CF 105710D - Sample Collecting

Sure-please paste the full problem statement (or link/text), and I’ll write a Codeforces-style editorial. If you want a specific format (e.g., intuition → observations → solution → complexity → implementation tips → common pitfalls), tell me that too.