HUSTPC 2022 | brain

#	Problem	Time	✓
A	Common Edges	55s	✓
B	Contest Preparation	56s	✓
C	Diameter	2m 10s
D	Difference	50s	✓
E	Ellipse	1m 1s	✓
F	K-th Power	50s	✓
G	Nerdle	2m 11s
H	Permutation Counting	54s	✓
I	Repetition	49s	✓
J	Sequence	46s	✓
K	Triangles	52s	✓
L	WA Sorting	47s	✓
M	XOR Almost Everything	2m 5s

Practice › Codeforces Solutions › HUSTPC 2022 ›

CF 103741M - XOR Almost Everything

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 › HUSTPC 2022 ›

CF 103741K - Triangles

We are given a 500 by 500 integer grid in the plane, so all relevant coordinates live in a small bounded box. Each input item describes a unit diagonal segment that connects a lattice point $(xi, yi)$ to $(xi-1, yi-1)$.

Practice › Codeforces Solutions › HUSTPC 2022 ›

CF 103741L - WA Sorting

We are given a permutation of length n, and we conceptually process its prefixes one by one. For each prefix A[1..k], we imagine running a given sorting procedure called SORT, and we are asked to record how many times a specific variable m gets assigned during that run.

Practice › Codeforces Solutions › HUSTPC 2022 ›

CF 103741G - Nerdle

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 › HUSTPC 2022 ›

CF 103741J - Sequence

We are maintaining a dynamic sequence of integers. The sequence starts empty and grows only by appending elements to the end. At any moment, we may be asked to compute a value derived from all pairs of elements where the first element is to the left of the second.

Practice › Codeforces Solutions › HUSTPC 2022 ›

CF 103741I - Repetition

We are given several long strings, and we want to extract a single “good” substring that behaves consistently across all of them. The requirement is that this substring must appear inside every given string at least k times.

Practice › Codeforces Solutions › HUSTPC 2022 ›

CF 103741H - Permutation Counting

We are given a permutation of numbers from 1 to n, but we do not know its order. Instead of directly constructing it, we are given constraints between positions. Each constraint is of the form “the value placed at position x is smaller than the value placed at position y”.

Practice › Codeforces Solutions › HUSTPC 2022 ›

CF 103741F - K-th Power

We are given an interval of integers from l to r, and a parameter k. A number is considered “bad” if it is divisible by p^k for some prime number p. Equivalently, a bad number contains a prime factor whose exponent in its factorization is at least k.

Practice › Codeforces Solutions › HUSTPC 2022 ›

CF 103741D - Difference

We are given an array of length $n$. For every contiguous subarray $[l, r]$, we define a value equal to the difference between the maximum element and the minimum element inside that subarray.

Practice › Codeforces Solutions › HUSTPC 2022 ›

CF 103741C - Diameter

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 › HUSTPC 2022 ›

CF 103741E - Ellipse

We are given a set of points indexed in a cycle. Each point is repeatedly updated by a geometric transformation that depends on the current centroid of all points and on its two cyclic neighbors.

Practice › Codeforces Solutions › HUSTPC 2022 ›

CF 103741B - Contest Preparation

We are given several independent jobs, where each job represents preparing a contest problem. Every problem consists of two sequential stages: first it must be created, and only after that it can be checked or validated. There are n problems in total and m available people.

Practice › Codeforces Solutions › HUSTPC 2022 ›

CF 103741A - Common Edges

We are given a connected undirected graph. Each query gives four vertices $u, v, x, y$. From these four vertices we must build two paths.