The 2022 Hangzhou Normal U Summer Trials

11 problems from The 2022 Hangzhou Normal U Summer Trials (contest 103736), difficulty -. 9/11 solutions verified against sample I/O.

11 items

The 2022 Hangzhou Normal U Summer Trials

Special | 11 problems | 9/11 verified | Difficulty - | 11m 18s

#	Problem	Time	✓
A	Hello, ACMer!	41s	✓
B	New String	49s	✓
C	Check Problems	2m 7s
D	Tree Problem	51s	✓
E	Easy Problem	50s	✓
F	Subarrays	47s	✓
G	Ganyu Segment Tree	2m 10s
H	Optimal Biking Strategy	47s	✓
I	IHI's Homework	51s	✓
J	IHI's Magic String	41s	✓
K	Klee's Wonderful Adventure	44s	✓

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

CF 103736K - Klee's Wonderful Adventure

We are given a set of points on a 2D plane. Each point is a node, and Klee can move directly between any pair of points. The cost of moving depends only on which quadrants the two endpoints lie in.

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

CF 103736G - Ganyu Segment Tree

Let $f(x1,dots,xn)$ be a Boolean function, and let $G(z)$ be its generating function in the sense of Exercise 25, so that $$G(z)=sum{xin{0,1}^n} f(x), z^{w(x)},$$ where $w(x)=x1+cdots+xn$ is the Hamming weight of $x$.

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

CF 103736J - IHI's Magic String

We are maintaining a string that starts empty and is modified by a sequence of operations. Each operation either appends a lowercase character to the end, removes the last character if one exists, or performs a global substitution that replaces every occurrence of a given…

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

CF 103736I - IHI's Homework

We are given an array of lower bounds on variables and a target sum constraint. Each variable $xi$ must be at least $ai$, and we are asked how many integer vectors $x1, x2, dots, xn$ satisfy $$x1 + x2 + dots + xn le s$$ After each update, one position of the array $a$ is…

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

CF 103736H - Optimal Biking Strategy

We are given a straight road from position 0 to position p, and Alice starts at 0 and wants to reach p. Along this road there are several fixed bike stops where she is allowed to switch between walking and biking, but biking is only meaningful between consecutive stops she…

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

CF 103736F - Subarrays

We are given a sequence of integers and asked to count how many contiguous subarrays have a sum divisible by a given integer $k$.

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

CF 103736C - Check Problems

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

CF 103736E - Easy Problem

We are given an $n times n$ grid that behaves like a small maze. Each cell is either free space, an obstacle, or contains one of two special starting positions labeled for two players.

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

CF 103736D - Tree Problem

We are working with a tree, meaning a connected acyclic graph where every pair of vertices is connected by exactly one simple path. For each query vertex x, we need to count how many distinct simple paths in the tree pass through x.

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

CF 103736B - New String

We are given a custom ordering of the English lowercase alphabet, where the 26 letters appear in a specific sequence that defines a strict total order. If a letter appears earlier in this ordering, it is considered smaller.

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

CF 103736A - Hello, ACMer!

We are given a single lowercase string and asked to count how many times the fixed pattern "hznu" appears as a contiguous block inside it.