UTPC Spring 2023 Open Contest

14 problems from UTPC Spring 2023 Open Contest (contest 104294), difficulty -. 9/14 solutions verified against sample I/O.

14 items

UTPC Spring 2023 Open Contest

Special | 14 problems | 9/14 verified | Difficulty - | 23m 11s

# Problem Rating Tags Accepted Time ✓
A Square Jutsu! 1m 24s ✓
B Angel Beats 1m 41s ✓
C Attack on Titans 1m 10s ✓
D No Game No Life 2m 53s
E Monster-Slayer 1m 4s ✓
F Karuta Memories 2m 9s ✓
G Howl's Moving Castle 1m 15s ✓
H Beyblade Battle 1m 31s ✓
I Snack Time 1m 37s ✓
J 3 Reasons to Eat Potato Chips 1m 51s ✓
K Anime Trading 1m 39s
L My Hero Photographia 1m 38s
M Who Is a Titan? 1m 39s
N Portal Investigation 1m 40s
Practice › Codeforces Solutions › UTPC Spring 2023 Open Contest ›

CF 104294N - Portal Investigation

We are given a directed graph where cities are nodes and magical portals are directed edges. Each portal represents a one-way travel route. Misaka wants to “investigate” as many portals as possible using multiple independent agents called clones.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › UTPC Spring 2023 Open Contest ›

CF 104294L - My Hero Photographia

We are given a rectangular grid of integers representing an image. Each cell is a pixel, and its value is an intensity. The grid is not just a flat array, but a torus: moving off the right edge brings you back to the left, moving off the top brings you back to the bottom.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › UTPC Spring 2023 Open Contest ›

CF 104294M - Who Is a Titan?

We are given a collection of entities, each initially isolated, and a sequence of historical statements describing pairwise interactions between them.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › UTPC Spring 2023 Open Contest ›

CF 104294K - Anime Trading

We are given a multiset of anime trading cards, where each card has an integer label called a quirk number. Midoriya wants to end up with a very specific final collection: it must contain exactly one copy of each integer from 1 up to some value K, with no gaps and no extras.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › UTPC Spring 2023 Open Contest ›

CF 104294J - 3 Reasons to Eat Potato Chips

We are given three piles of chips. On each move, a player can either take chips from exactly one pile, choosing any positive number up to what remains in that pile, or take chips from all three piles simultaneously, choosing a positive number up to the smallest current pile…
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › UTPC Spring 2023 Open Contest ›

CF 104294I - Snack Time

We are given a tree of houses, where each house initially contains a certain number of friends. The roads form a connected acyclic structure, so between any two houses there is exactly one simple path. There are two types of events.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › UTPC Spring 2023 Open Contest ›

CF 104294H - Beyblade Battle

We are simulating a point moving in the plane under mirror reflections, and we care about two things: how close the moving point ever gets to the origin, and how many times it reflects off two fixed lines passing through the origin. The geometry is completely deterministic.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › UTPC Spring 2023 Open Contest ›

CF 104294D - No Game No Life

We are given a string s of length N, where each position also carries a weight ai. We are allowed to choose any subset of alphabet characters (both lowercase and uppercase).
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › UTPC Spring 2023 Open Contest ›

CF 104294F - Karuta Memories

Each leaf behaves like an object that falls straight down while being pushed horizontally by a time dependent wind. The wind at second t is a linear function of a global parameter k, so every second contributes a term of the form at + k dt.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › UTPC Spring 2023 Open Contest ›

CF 104294G - Howl's Moving Castle

We are given a tree with $N$ rooms connected by $N-1$ hallways. Each hallway is either usable or blocked, and blocking hallways partitions the tree into several connected components.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › UTPC Spring 2023 Open Contest ›

CF 104294E - Monster-Slayer

We are given a line of monsters, each with an integer power value. We want to choose a contiguous block of these monsters and compute the sum of their powers. Among all possible contiguous blocks, we need the one whose sum is as large as possible, and we output that sum.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › UTPC Spring 2023 Open Contest ›

CF 104294B - Angel Beats

We are given several independent groups of angels. Each group contains a multiset of combat powers, and whenever a defense is formed, exactly one angel must be chosen from each group. The defense power is the sum of the chosen angels’ powers.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › UTPC Spring 2023 Open Contest ›

CF 104294A - Square Jutsu!

We are given an $N times N$ grid representing terrain heights. Each cell has an integer elevation, and the grid has a structural monotonic property: every cell is no higher than its right, bottom, and bottom-right neighbors.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › UTPC Spring 2023 Open Contest ›

CF 104294C - Attack on Titans

We are given three separate sequences, each representing the section heights of a wall. Every wall has the same number of sections, but the ordering is irrelevant for the task. What matters is only which heights appear in each wall at least once.
codeforces competitive-programming Jul 1, 2026