The 16-th BIT Campus Programming Contest - Online Round(2022)

6 problems from The 16-th BIT Campus Programming Contest - Online Round(2022) (contest 104024), difficulty -. 4/6 solutions verified against sample I/O.

6 items

The 16-th BIT Campus Programming Contest - Online Round(2022)

Special | 6 problems | 4/6 verified | Difficulty - | 7m 20s

#	Problem	Time	✓
A	Saki	36s	✓
B	ZYW with his score	42s	✓
C	Array Brush	2m 5s
D	Bookworm	1m 2s	✓
E	Diameter	57s	✓
F	Subsequence	1m 58s

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Online Round(2022) ›

CF 104024F - Subsequence

Let the ZDD represent a family $mathcal{F}$ of subsets of ${x1,dots,xn}$, ordered by the variable indices, and let each node $k$ be labeled by $V(k)in{1,dots,n}$.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Online Round(2022) ›

CF 104024E - Diameter

We are given an array of values indexed from 1 to n. From this array, we define a complete weighted graph where every pair of distinct indices u and v is connected by a single edge.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Online Round(2022) ›

CF 104024D - Bookworm

We are given a collection of book titles, each title being a lowercase string. One of these titles is chosen as the starting point.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Online Round(2022) ›

CF 104024C - Array Brush

Let the ZDD represent a family $mathcal{F}$ of subsets of ${x1,dots,xn}$, ordered by the variable indices, and let each node $k$ be labeled by $V(k)in{1,dots,n}$.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Online Round(2022) ›

CF 104024A - Saki

We are given the name of a special mahjong hand written as a string, and we must output the exact sequence of tiles that correspond to that named hand.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Online Round(2022) ›

CF 104024B - ZYW with his score

We are given two integers that come from two hidden numbers, call them $a$ and $b$. Instead of revealing $a$ and $b$ directly, we are only told their sum $a + b$ and their bitwise AND $a land b$. The task is to recover the bitwise XOR $a oplus b$.