UT Open 2025

13 problems from UT Open 2025 (contest 105811), difficulty -. 5/13 solutions verified against sample I/O.

13 items

UT Open 2025

Special | 13 problems | 5/13 verified | Difficulty - | 7m 46s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Fishy Tank				37s	✓
B	Card Counting				30s
C	Balloon Fiesta				44s	✓
D	City Renewal				47s	✓
E	Cable Plan				58s	✓
F	Night Ride				39s
G	Music Festival				25s
H	Lineism				27s
I	Game, Set, Match				27s
J	Security Breach				28s
K	Philadelphia Museum of Art				48s	✓
L	Trapped in the Big Apple				28s
M	Tea Party				28s

Practice › Codeforces Solutions › UT Open 2025 ›

CF 105811G - Music Festival

The problem statement for Codeforces 105811G - Music Festival is missing from your prompt, so there’s not enough information to construct a correct editorial.

Practice › Codeforces Solutions › UT Open 2025 ›

CF 105811M - Tea Party

I can’t write a correct Codeforces-style editorial for this problem because the actual problem statement is missing from your prompt.

Practice › Codeforces Solutions › UT Open 2025 ›

CF 105811L - Trapped in the Big Apple

I can’t write a correct editorial for this yet because the actual problem statement is missing. Right now I only have the title “Trapped in the Big Apple”, but no description of the grid/graph/process, no constraints, and no samples.

Practice › Codeforces Solutions › UT Open 2025 ›

CF 105811J - Security Breach

I can’t reliably write a correct Codeforces-style editorial for this problem yet because the actual problem statement is missing. With only the title “Security Breach” there’s no way to know what structures are involved (graphs, strings, queries, interactive system, etc.

Practice › Codeforces Solutions › UT Open 2025 ›

CF 105811I - Game, Set, Match

I can’t write a correct editorial for this yet because the actual problem statement for Codeforces 105811I - Game, Set, Match is missing from your prompt.

Practice › Codeforces Solutions › UT Open 2025 ›

CF 105811H - Lineism

I don’t actually have the problem statement for Codeforces 105811H - Lineism in your prompt (it’s blank), so there’s no way to correctly reconstruct the task, constraints, or intended solution.

Practice › Codeforces Solutions › UT Open 2025 ›

CF 105811F - Night Ride

I can’t write a correct editorial for this yet because the actual problem content (the statement, input/output definitions, and constraints) is missing.

Practice › Codeforces Solutions › UT Open 2025 ›

CF 105811B - Card Counting

I don’t have the statement of Codeforces 105811B - Card Counting available in context, and this problem ID doesn’t map to a commonly indexed Codeforces archive problem I can reliably reconstruct from memory.

Practice › Codeforces Solutions › UT Open 2025 ›

CF 105811K - Philadelphia Museum of Art

We are given a tree of museum rooms rooted at room 1, where room 1 is the entrance. Two people, Kuroni and Tfg, start at the entrance and always move together along a single path. At any non-leaf room, exactly one child room must be chosen as the next destination.

Practice › Codeforces Solutions › UT Open 2025 ›

CF 105811E - Cable Plan

The problem asks us to process many proposed cable lines over a set of houses placed on a plane. For every line, we need the largest perpendicular distance from any house to that line.

Practice › Codeforces Solutions › UT Open 2025 ›

CF 105811D - City Renewal

We are given a set of planned redevelopment projects along a single road. Each project sits at a distinct coordinate on a number line and contributes a certain profit if we choose to execute it.

Practice › Codeforces Solutions › UT Open 2025 ›

CF 105811C - Balloon Fiesta

We are given a string of length $n$, representing a row of balloons, where each position has a color. A “photo” is defined by taking a contiguous substring of this row, from $l$ to $r$. The key twist is that we do not care about the literal positions inside the photo alone.

Practice › Codeforces Solutions › UT Open 2025 ›

CF 105811A - Fishy Tank

The task is to draw a rectangular fish tank using ASCII characters. The tank always has a fixed size of 15 rows and 25 columns. The border uses o, -, and The input contains one integer representing the number of fish that must appear.