UTPC x WiCS Contest 10-25-24 (UT Internal)

10 problems from UTPC x WiCS Contest 10-25-24 (UT Internal) (contest 105450), difficulty -. 0/10 solutions verified against sample I/O.

10 items

UTPC x WiCS Contest 10-25-24 (UT Internal)

Special | 10 problems | 0/10 verified | Difficulty - | 15m 11s

# Problem Rating Tags Accepted Time ✓
A Minimize Sour Difference 1m 19s
B Sour Strip Shapes 1m 31s
C Sour Straws 1m 22s
D Trick or Treat 1m 24s
E Give Me Your Candy 1m 34s
F Houdini 1m 32s
G Treat or Trick 1m 35s
H Warhead Games 1m 27s
I Can I Find My Candy? 1m 28s
J Candy Production 1m 59s
Practice › Codeforces Solutions › UTPC x WiCS Contest 10-25-24 (UT Internal) ›

CF 105450I - Can I Find My Candy?

We are given an array of integers of length $n$. Each position stores a number that represents how many candies are in that bag.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › UTPC x WiCS Contest 10-25-24 (UT Internal) ›

CF 105450G - Treat or Trick

We can view the street as two parallel rows of houses, each row having $n$ positions. From any house at position $i$, Julia can move left or right along the same row, or switch vertically to the other row at the same position.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › UTPC x WiCS Contest 10-25-24 (UT Internal) ›

CF 105450H - Warhead Games

We are given a rectangular grid where each cell is either usable or blocked. A token starts at the top-left cell and two players alternate moves.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › UTPC x WiCS Contest 10-25-24 (UT Internal) ›

CF 105450E - Give Me Your Candy

We are given a line of candies, each with a numerical value representing how enjoyable it is to eat that candy. These values can be positive or negative, so taking a candy can either help or hurt the total enjoyment.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › UTPC x WiCS Contest 10-25-24 (UT Internal) ›

CF 105450D - Trick or Treat

We are given a set of points on a 2D grid, and we start from the origin at coordinate (0, 0). We want to choose a direction and walk in a straight line passing through the origin. While moving along that line, we collect all candies that lie exactly on it.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › UTPC x WiCS Contest 10-25-24 (UT Internal) ›

CF 105450C - Sour Straws

We are given a collection of integer lengths, each representing a sour straw. From these, we want to choose a subset such that when we sort the chosen lengths in nondecreasing order, every smaller element divides every larger element that comes after it.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › UTPC x WiCS Contest 10-25-24 (UT Internal) ›

CF 105450J - Candy Production

We are given a collection of machines, and each machine can be configured in one of three productive roles or left unused.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › UTPC x WiCS Contest 10-25-24 (UT Internal) ›

CF 105450A - Minimize Sour Difference

We are given a list of integer sourness values representing candies. Alice is allowed to remove exactly $k$ candies from this list, leaving $n-k$ candies behind.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › UTPC x WiCS Contest 10-25-24 (UT Internal) ›

CF 105450F - Houdini

We are given a tree with one value on each node, representing how many candies sit in that container. The magician is allowed to delete edges, which breaks the tree into connected components.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › UTPC x WiCS Contest 10-25-24 (UT Internal) ›

CF 105450B - Sour Strip Shapes

We are given two axis-aligned squares on a 2D grid. Each square is described by the coordinates of its lower-left corner and a side length.
codeforces competitive-programming Jun 23, 2026