The 19th Zhejiang University City College Programming Contest

12 problems from The 19th Zhejiang University City College Programming Contest (contest 103660), difficulty -. 10/12 solutions verified against sample I/O.

12 items

The 19th Zhejiang University City College Programming Contest

Special | 12 problems | 10/12 verified | Difficulty - | 12m 49s

#	Problem	Time	✓
A	Who is The 19th ZUCCPC Champion	55s	✓
B	Jiubei and Overwatch	48s	✓
C	Ah, It's Yesterday Once More	2m 12s
D	Reflection	1m 1s	✓
E	Disjoint Path On Tree	51s	✓
F	Sum of Numerators	50s	✓
G	Guaba and Computational Geometry	43s	✓
H	Distance	2m 9s
I	Array Division	52s	✓
J	Substring Inversion (Easy Version)	49s	✓
K	Substring Inversion (Hard Version)	52s	✓
L	Monster Tower	47s	✓

Practice › Codeforces Solutions › The 19th Zhejiang University City College Programming Contest ›

CF 103660H - Distance

Let $G$ be the Cayley graph of the symmetric group $Sn$ with generators $(alpha1,dots,alphak)$, and assume that each generator satisfies $$alphaj(x)=y$$ for fixed distinct symbols $x,y in {1,dots,n}$.

Practice › Codeforces Solutions › The 19th Zhejiang University City College Programming Contest ›

CF 103660K - Substring Inversion (Hard Version)

We are given a string made of lowercase letters. We are asked to count pairs of substrings taken from different starting positions such that the substring starting earlier in the string is lexicographically larger than the substring starting later.

Practice › Codeforces Solutions › The 19th Zhejiang University City College Programming Contest ›

CF 103660L - Monster Tower

We are given a tower of monsters arranged in a line from bottom to top. Each floor has a monster with a fixed strength. A player starts with some initial strength $x$.

Practice › Codeforces Solutions › The 19th Zhejiang University City College Programming Contest ›

CF 103660J - Substring Inversion (Easy Version)

We are given a string and we want to count ordered pairs of substrings where the first substring is lexicographically greater than the second one, with the additional restriction that the first substring must start strictly earlier in the string.

Practice › Codeforces Solutions › The 19th Zhejiang University City College Programming Contest ›

CF 103660I - Array Division

We are given two arrays of equal length, and we want to cut the index range from 1 to n into several consecutive segments. Each index must belong to exactly one segment, and the segments must cover the whole array without gaps or overlap.

Practice › Codeforces Solutions › The 19th Zhejiang University City College Programming Contest ›

CF 103660F - Sum of Numerators

We are given two integers, $n$ and $k$, and a sequence of $n$ fractions whose structure follows a fixed pattern. The denominators are all the same value, while the numerators form a simple arithmetic progression starting from 1 up to $n$.

Practice › Codeforces Solutions › The 19th Zhejiang University City College Programming Contest ›

CF 103660G - Guaba and Computational Geometry

We are given a collection of axis-aligned rectangles on a 2D plane. Each rectangle has a weight, and we want to pick exactly two rectangles such that they do not overlap in the sense that there is no point that lies inside both rectangles, and maximize the sum of their weights.

Practice › Codeforces Solutions › The 19th Zhejiang University City College Programming Contest ›

CF 103660C - Ah, It's Yesterday Once More

Let $G$ be the Cayley graph of $Sn$ with generating set $${sigma,tau}, qquad sigma = (1,2,dots,n), quad tau = (1,2),$$ where $n ge 3$ is odd.

Practice › Codeforces Solutions › The 19th Zhejiang University City College Programming Contest ›

CF 103660D - Reflection

We are given a grid containing $n$ mirrors placed at distinct coordinates. Each mirror has a type, either A or B, which determines how a light ray changes direction when it hits that mirror.

Practice › Codeforces Solutions › The 19th Zhejiang University City College Programming Contest ›

CF 103660E - Disjoint Path On Tree

We are given a tree, and we consider every simple path inside it. A simple path is any sequence of vertices where each vertex is visited at most once, so in a tree this is exactly the unique path between any two chosen endpoints, including the degenerate case where both…

Practice › Codeforces Solutions › The 19th Zhejiang University City College Programming Contest ›

CF 103660A - Who is The 19th ZUCCPC Champion

The task describes an output-only situation where there is no input to read. We are only required to print a single string that would be considered valid as an answer.

Practice › Codeforces Solutions › The 19th Zhejiang University City College Programming Contest ›

CF 103660B - Jiubei and Overwatch

We are given a damage skill whose output depends on how long it is charged. The damage grows linearly, but the growth rate changes once the charging time crosses a threshold $k$. Before or at $k$ seconds, each second contributes $x$ damage.