UTPC Contest 10-23-20 Div. 1

9 problems from UTPC Contest 10-23-20 Div. 1 (contest 102784), difficulty -. 7/9 solutions verified against sample I/O.

9 items

UTPC Contest 10-23-20 Div. 1

Div. 1 | 9 problems | 7/9 verified | Difficulty - | 8m 29s

#	Problem	Time	✓
C	Optimal Trick or Treating	1m 1s	✓
D	Ghost-or-Treat	1m 21s	✓
E	Spooky Numbers	57s	✓
F	Xorro the Xorman	50s
G	Hyper Chocolate Cubes	52s	✓
H	Slime-inator	54s	✓
I	Candy Supply	34s
J	Jackie's Jack-O'-Lanterns	54s	✓
K	Territorial Tarantulas	1m 6s	✓

Practice › Codeforces Solutions › UTPC Contest 10-23-20 Div. 1 ›

CF 102784D - Ghost-or-Treat

We have a line of ghosts, where each ghost has an integer age. A move consists of choosing two neighboring ghosts whose ages are different. The older ghost defeats the younger one and remains in the line, but surviving makes it one year older. The younger ghost disappears.

Practice › Codeforces Solutions › UTPC Contest 10-23-20 Div. 1 ›

CF 102784C - Optimal Trick or Treating

Timmy knows the candy offers that Alice will accept. Each candy type has a fixed exchange value, meaning every piece of that candy contributes the same number of Chuckles bars. There are several houses, and each house provides a collection of candy types with certain quantities.

Practice › Codeforces Solutions › UTPC Contest 10-23-20 Div. 1 ›

CF 102784K - Territorial Tarantulas

We have a tree of N burrows. Each vertex contains one tarantula, and every tarantula belongs to one of K subspecies. The tunnels form a connected tree, so there is exactly one path between any two burrows.

Practice › Codeforces Solutions › UTPC Contest 10-23-20 Div. 1 ›

CF 102784J - Jackie's Jack-O'-Lanterns

The task is to decide whether two pumpkin drawings have the same topology. The actual shapes of the carved regions do not matter. What matters is the nesting relationship between connected pumpkin flesh pieces and connected holes.

Practice › Codeforces Solutions › UTPC Contest 10-23-20 Div. 1 ›

CF 102784I - Candy Supply

I can write the editorial, but the problem statement is missing. The section under “Problem Statement” is empty, so I do not have the rules, constraints, input format, or required output for Codeforces 102784I - Candy Supply.

Practice › Codeforces Solutions › UTPC Contest 10-23-20 Div. 1 ›

CF 102784H - Slime-inator

The city is an n x n grid. A slime source starts at cell (x, y) and spreads one step in the four cardinal directions every second. After t seconds, a cell is covered exactly when its Manhattan distance from the starting cell is at most t.

Practice › Codeforces Solutions › UTPC Contest 10-23-20 Div. 1 ›

CF 102784G - Hyper Chocolate Cubes

The problem asks whether a package containing exactly x chocolate cubes can be balanced using Felix's collection of hypercube packages. The available packages have sizes 1, w, w², ..., w¹⁰⁰, where w is the side length of each hypercube.

Practice › Codeforces Solutions › UTPC Contest 10-23-20 Div. 1 ›

CF 102784F - Xorro the Xorman

I can write the editorial, but the requested format requires several sections that depend on the exact official statement details, especially the sample inputs for the test-case section.

Practice › Codeforces Solutions › UTPC Contest 10-23-20 Div. 1 ›

CF 102784E - Spooky Numbers

Francine has a collection of individual digits and wants to arrange some of them into the largest possible number that Buster considers spooky. A spooky number is a non-negative integer divisible by 2, 3, and 5, which is the same as being divisible by 30.