The 2021 Hangzhou Normal U Summer Trials

10 problems from The 2021 Hangzhou Normal U Summer Trials (contest 103114), difficulty -. 8/10 solutions verified against sample I/O.

10 items

The 2021 Hangzhou Normal U Summer Trials

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

#	Problem	Time	✓
A	Aahaxiki's journey I - set off	53s	✓
B	Bsueh- and Gold Medals	2m 30s
C	Chtholly and Floating Islands	1m 9s	✓
D	Dllllan and his friends	55s	✓
E	Ewo Slices of Bread with Cheese	56s	✓
F	Fstee1XD and Minioins	42s	✓
G	Guess Permutation	53s	✓
H	Hsueh- and Meeting	1m 33s
I	Iahaxiki's journey II - enjoying	1m 11s	✓
J	Jahaxiki's journey III - Tryna lost	54s	✓

Practice › Codeforces Solutions › The 2021 Hangzhou Normal U Summer Trials ›

CF 103114H - Hsueh- and Meeting

Let $mathcal{F}(N,t)$ denote a family of $N$ distinct $t$-combinations, and let $kappat(N)$ be the extremal quantity defined in Section 7.2.1.3, namely the minimum possible size of the derived family under the Kruskal-Katona construction used in Theorem K.

Practice › Codeforces Solutions › The 2021 Hangzhou Normal U Summer Trials ›

CF 103114J - Jahaxiki's journey III - Tryna lost

We are given a grid-like planar map where movement happens between small square cells. Each cell is potentially connected to its neighboring cells through openings, while barriers are represented implicitly by wall characters in a textual layout.

Practice › Codeforces Solutions › The 2021 Hangzhou Normal U Summer Trials ›

CF 103114I - Iahaxiki's journey II - enjoying

We are given a weighted tree with $n$ vertices. Each edge connects two vertices and has a positive length. The task is to choose a simple path in this tree such that the path contains exactly $k$ vertices, and among all such paths we want the one with the maximum possible…

Practice › Codeforces Solutions › The 2021 Hangzhou Normal U Summer Trials ›

CF 103114G - Guess Permutation

We are given a hidden permutation of the numbers from 1 to n, stored across positions 1 to n. Our task is to recover the entire permutation, meaning we must determine the exact value at every position. The only way to obtain information is through queries.

Practice › Codeforces Solutions › The 2021 Hangzhou Normal U Summer Trials ›

CF 103114F - Fstee1XD and Minioins

The process described in this problem is a deterministic population growth system where each individual has an age-dependent reproduction rule. We start with a single minion born on day one.

Practice › Codeforces Solutions › The 2021 Hangzhou Normal U Summer Trials ›

CF 103114B - Bsueh- and Gold Medals

Practice › Codeforces Solutions › The 2021 Hangzhou Normal U Summer Trials ›

CF 103114E - Ewo Slices of Bread with Cheese

We are given a collection of cheese pieces, each with an initial freshness value. Time advances in discrete days. Every day, all remaining pieces simultaneously lose one unit of freshness.

Practice › Codeforces Solutions › The 2021 Hangzhou Normal U Summer Trials ›

CF 103114D - Dllllan and his friends

We are given a set of points on the plane, each representing a friend’s house. We need to choose a single point, interpreted as the location of a new home, and also compute a travel cost associated with visiting all friends from that home.

Practice › Codeforces Solutions › The 2021 Hangzhou Normal U Summer Trials ›

CF 103114C - Chtholly and Floating Islands

We are given a line of numbered islands starting from island 1 up to island n. From any island j, Chtholly can jump forward by adding one value from a set of available “step sizes”, meaning she moves from j to j + x where x is chosen from her current ability list.

Practice › Codeforces Solutions › The 2021 Hangzhou Normal U Summer Trials ›

CF 103114A - Aahaxiki's journey I - set off

The task describes a transportation network over a set of cities, where each city contains four internal “modes” of being: school, train station, airport, and competition site.