UTPC Spring 2023 Contest (HS)

12 problems from UTPC Spring 2023 Contest (HS) (contest 104312), difficulty -. 10/12 solutions verified against sample I/O.

12 items

UTPC Spring 2023 Contest (HS)

Special | 12 problems | 10/12 verified | Difficulty - | 15m 8s

#	Problem	Time	✓
A	Dojo Duel	59s	✓
B	Snack Time	1m 22s
C	Milk Cow	52s	✓
D	Love is War	1m 5s	✓
E	Attack on Titans	1m	✓
F	Dragon Ball	1m 7s	✓
G	Anime Trading	1m 40s
H	My Hero Photographia	1m 34s	✓
I	Square Jutsu!	1m 38s	✓
J	No Game No Life	1m 32s	✓
K	Monster-Slayer	1m 9s	✓
L	3 Reasons to Eat Potato Chips	1m 10s	✓

Practice › Codeforces Solutions › UTPC Spring 2023 Contest (HS) ›

CF 104312L - 3 Reasons to Eat Potato Chips

We are given three piles of chips. On each turn, a player can either take chips from exactly one pile, choosing any positive number up to the size of that pile, or perform a global move where they take the same positive number of chips from all three piles simultaneously, but…

Practice › Codeforces Solutions › UTPC Spring 2023 Contest (HS) ›

CF 104312J - No Game No Life

We are given a base string s of length N, where each position has an associated weight ai. From this string, we are allowed to “erase” characters by choosing a subset of letters from the alphabet.

Practice › Codeforces Solutions › UTPC Spring 2023 Contest (HS) ›

CF 104312K - Monster-Slayer

We are given a line of monsters, each with a power value, positive or negative. Saitama can choose any consecutive segment of these monsters and defeat exactly that group.

Practice › Codeforces Solutions › UTPC Spring 2023 Contest (HS) ›

CF 104312I - Square Jutsu!

We are given a fixed $N times N$ grid of elevations. Every query gives an interval $[a, b]$, and we must find the largest axis-aligned square subgrid such that every cell inside it has elevation within that interval. The answer is the area of that square, not its side length.

Practice › Codeforces Solutions › UTPC Spring 2023 Contest (HS) ›

CF 104312G - Anime Trading

We are given a multiset of cards, where each card has an integer label called a quirk number. From this initial collection, we want to end up with a very strict final collection: it must contain exactly one card of each quirk number from 1 up to some chosen value K, and…

Practice › Codeforces Solutions › UTPC Spring 2023 Contest (HS) ›

CF 104312H - My Hero Photographia

We are given a rectangular grid of integers representing pixel intensities. The grid behaves like a torus, meaning moving off any edge wraps around to the opposite side.

Practice › Codeforces Solutions › UTPC Spring 2023 Contest (HS) ›

CF 104312F - Dragon Ball

We are maintaining a dynamic collection of “habitats”, where each habitat stores multiple named dragons, and every dragon has a unique size value. The system supports two operations over time. One operation inserts a new dragon into a chosen habitat.

Practice › Codeforces Solutions › UTPC Spring 2023 Contest (HS) ›

CF 104312E - Attack on Titans

We are given three independent walls, each described as an array of section heights. Each array contains $n$ integers, where each integer represents the height of a segment in that wall.

Practice › Codeforces Solutions › UTPC Spring 2023 Contest (HS) ›

CF 104312D - Love is War

We are given a collection of short text messages, each independent from the others. For every message, we need to decide whether it represents a “battle” or just casual conversation.

Practice › Codeforces Solutions › UTPC Spring 2023 Contest (HS) ›

CF 104312B - Snack Time

We are given a tree of houses. Each house initially has a certain number of friends living there. Over time, two kinds of events happen.

Practice › Codeforces Solutions › UTPC Spring 2023 Contest (HS) ›

CF 104312A - Dojo Duel

We are given a list of students, where each student comes with a name and four numerical attributes: kicking skill, magic skill, speed, and demon slaying skill. The task is to produce a ranking of all students based on a strict multi-level priority system.

Practice › Codeforces Solutions › UTPC Spring 2023 Contest (HS) ›

CF 104312C - Milk Cow

The task is a pure transformation problem on text. We are given an ASCII picture of Bessie the cow, represented as multiple lines of characters. We must output what the picture looks like after being rotated 180 degrees.