UTPC Contest 9-25-20 Div. 1

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

9 items

UTPC Contest 9-25-20 Div. 1

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

#	Problem	Time	✓
C	Isabelle's Redecorating	1m 3s	✓
D	Combo Counter	39s
E	Kario Mart	55s
F	Special Salads	1m 37s	✓
G	Letters Among Us	58s	✓
H	E. Gadd's Ghost Zapper	1m 1s	✓
I	Stunt Jump Escape	1m 5s	✓
J	E-Sports Tournament	57s	✓
K	Crafty Explosions	44s	✓

Practice › Codeforces Solutions › UTPC Contest 9-25-20 Div. 1 ›

CF 102741E - Kario Mart

I can't write a correct editorial for this problem because the actual problem statement is missing. The prompt only includes: - Problem: Codeforces 102741E - Kario Mart - Empty "Problem Statement", "Input", and "Output" sections.

Practice › Codeforces Solutions › UTPC Contest 9-25-20 Div. 1 ›

CF 102741D - Combo Counter

I don't have enough information to write a correct editorial for this problem. The prompt only includes the title, "Codeforces 102741D - Combo Counter", but the actual problem statement, input format, output format, constraints, and samples are missing.

Practice › Codeforces Solutions › UTPC Contest 9-25-20 Div. 1 ›

CF 102741K - Crafty Explosions

The problem asks for the least volatility of one newly placed TNT piece so that every existing TNT piece is guaranteed to explode immediately. The new TNT can be placed at any real-valued position in three-dimensional space.

Practice › Codeforces Solutions › UTPC Contest 9-25-20 Div. 1 ›

CF 102741J - E-Sports Tournament

The system maintains a social network of users. A friendship connection joins two users into the same friend group, where groups are connected components of the graph. For every tournament query, we are asked how many teams of exactly size s can be formed.

Practice › Codeforces Solutions › UTPC Contest 9-25-20 Div. 1 ›

CF 102741I - Stunt Jump Escape

The map is a grid of hills. Michael starts somewhere on the top edge and moves one row downward every minute, while Trevor starts somewhere on the left edge and moves one column to the right every minute.

Practice › Codeforces Solutions › UTPC Contest 9-25-20 Div. 1 ›

CF 102741H - E. Gadd's Ghost Zapper

We have a set of zapper positions on a one dimensional hallway and a set of ghost positions on the same line. Each ghost must be removed by choosing one zapper. If a ghost is at distance d from the chosen zapper, the energy spent is d².

Practice › Codeforces Solutions › UTPC Contest 9-25-20 Div. 1 ›

CF 102741G - Letters Among Us

We are given a rectangular board of lowercase letters. Each row is a string, and we are allowed to remove entire columns from the board.

Practice › Codeforces Solutions › UTPC Contest 9-25-20 Div. 1 ›

CF 102741F - Special Salads

The problem describes salad types as integers from 1 to 10^8. Each type has a price determined by a special rounding rule: the price of type x is the smallest number greater than or equal to x whose decimal representation contains only the digits 3 and 8.

Practice › Codeforces Solutions › UTPC Contest 9-25-20 Div. 1 ›

CF 102741C - Isabelle's Redecorating

The room is an N × M grid of square floor cells. Isabelle wants to replace the whole grid with identical L-shaped tiles. Each tile covers four cells: three cells in a straight line and one extra cell attached to one end, and the tile can be rotated.