UMPT 2020-2021 Team Tryout Contest

10 problems from UMPT 2020-2021 Team Tryout Contest (contest 102944), difficulty -. 8/10 solutions verified against sample I/O.

10 items

UMPT 2020-2021 Team Tryout Contest

Special | 10 problems | 8/10 verified | Difficulty - | 11m 39s

# Problem Rating Tags Accepted Time ✓
A Ann Arbor 41s ✓
B Bois Blanc 2m 35s
C Canton 45s ✓
D Detroit 1m 4s ✓
E East Lansing 46s ✓
F Flint 40s ✓
G Grand Rabbits 43s ✓
H Holland 59s ✓
I Isle Royale 51s ✓
J Jackson 2m 35s
Practice › Codeforces Solutions › UMPT 2020-2021 Team Tryout Contest ›

CF 102944J - Jackson

Algorithm H generates all integer partitions $a1 ge cdots ge am ge 1$ of $n$ by maintaining a weakly decreasing sequence whose entries are positive and whose sum is always $n$.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UMPT 2020-2021 Team Tryout Contest ›

CF 102944I - Isle Royale

We are given a weighted undirected graph where vertices represent locations on an island and edges represent paths between them. The hero starts at node 1 and wants to reach node N. Traveling along an edge takes one minute and consumes energy equal to the edge weight.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UMPT 2020-2021 Team Tryout Contest ›

CF 102944H - Holland

We are given a stream of customers who arrive over time at a single counter. Each customer has an arrival time and a tip value. If a customer is accepted, they join a FIFO line and are served one by one, with each service taking exactly the same fixed amount of time.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UMPT 2020-2021 Team Tryout Contest ›

CF 102944B - Bois Blanc

Let the $2times 2times 3$ torus be the Cartesian product $$T = mathbb{Z}2 times mathbb{Z}2 times mathbb{Z}3,$$ so each element is a triple $(x,y,z)$ with $x,y in {0,1}$ and $z in {0,1,2}$, with arithmetic taken modulo $2,2,3$ respectively. This gives $12$ vertices.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UMPT 2020-2021 Team Tryout Contest ›

CF 102944G - Grand Rabbits

We are given a single array of positive weights along a line, representing how much delivery load each rabbit family contributes. Each day, we are given a contiguous segment of this array, and we must split that segment into exactly $k$ contiguous groups.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UMPT 2020-2021 Team Tryout Contest ›

CF 102944F - Flint

We are given a small collection of positive integers. From this collection, we consider every possible non-empty subset and compute the greatest common divisor of the numbers inside that subset. A subset is considered “valid” if this gcd equals exactly 1.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UMPT 2020-2021 Team Tryout Contest ›

CF 102944D - Detroit

We are given a directed graph representing a city road system, where each road can only be used in one direction and every road has unit cost in the sense that we will eventually count how many roads we decide to keep.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UMPT 2020-2021 Team Tryout Contest ›

CF 102944E - East Lansing

We are given a rectangular grid of size up to 100 by 100. Each cell represents a seat and is already painted either green, blue, or left neutral. Green and blue are fixed, while neutral seats can be freely assigned either green or blue.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UMPT 2020-2021 Team Tryout Contest ›

CF 102944C - Canton

We are given a rectangular grid representing a store floor plan. Each cell contains a direction character that acts like a deterministic instruction: if a customer stands on that cell, they move one step north, south, east, or west according to the arrow.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › UMPT 2020-2021 Team Tryout Contest ›

CF 102944A - Ann Arbor

We are given a simple daily log of customer arrivals to a bubble tea shop. Each day has a number of customers, and every time the total number of customers reaches a multiple of a fixed value k, that customer receives a free drink.
codeforces competitive-programming Jul 4, 2026