2022 Summer Camp of XTU Qualifying Round

6 problems from 2022 Summer Camp of XTU Qualifying Round (contest 103824), difficulty -. 4/6 solutions verified against sample I/O.

6 items

2022 Summer Camp of XTU Qualifying Round

Special | 6 problems | 4/6 verified | Difficulty - | 5m 31s

#	Problem	Time	✓
A	\u5361\u5c14\u7684\u793c\u7269	42s
B	DUEL!	1m 5s	✓
C	\u6298\u78e8\u738b(easy version)	50s	✓
D	\u4e0a\u5206	1m 10s	✓
E	awa\u75c7\u5019\u7fa4	49s	✓
F	\u6298\u78e8\u738b(hard version)	55s

Practice › Codeforces Solutions › 2022 Summer Camp of XTU Qualifying Round ›

CF 103824F - 折磨王(hard version)

Let $v$ be a node of the reduced ordered BDD for $f$, and let $Fv(p)$ denote the reliability polynomial of the subfunction represented at $v$ under the specialization $p1=cdots=pn=p$. Let $F'v(p)$ denote its derivative with respect to $p$.

Practice › Codeforces Solutions › 2022 Summer Camp of XTU Qualifying Round ›

CF 103824D - 上分

We are given a sequence of distinct integers representing rating changes from upcoming contests. We are allowed to reorder these values arbitrarily and feed them to a process that simulates how many contests a player ends up actually playing.

Practice › Codeforces Solutions › 2022 Summer Camp of XTU Qualifying Round ›

CF 103824E - awa症候群

We are given a string of lowercase letters and a target number of occurrences of the pattern “awa”. We are allowed to modify characters freely, but each modification changes exactly one position to any lowercase letter.

Practice › Codeforces Solutions › 2022 Summer Camp of XTU Qualifying Round ›

CF 103824B - DUEL!

We are given a grid with dimensions $n times m$. Each operation allows Rabbit to shrink the grid by removing some positive number of rows or some positive number of columns.

Practice › Codeforces Solutions › 2022 Summer Camp of XTU Qualifying Round ›

CF 103824C - 折磨王(easy version)

We start with a permutation of size $n$, and we are allowed to perform swaps of any two positions freely. Each swap exchanges the values at two indices, so in effect we are working in the full symmetric group where any transposition is allowed.

Practice › Codeforces Solutions › 2022 Summer Camp of XTU Qualifying Round ›

CF 103824A - 卡尔的礼物

Let $f(x1,ldots,xn)$ be a Boolean function and let $$G(z)=sum{x1=0}^1 cdots sum{xn=0}^1 z^{x1+cdots+xn} f(x1,ldots,xn)$$ be its generating function as defined in the preceding exercise.