2020-2021 “Orz Panda” Cup Programming Contest

10 problems from 2020-2021 “Orz Panda” Cup Programming Contest (contest 102870), difficulty -. 9/10 solutions verified against sample I/O.

10 items

2020-2021 “Orz Panda” Cup Programming Contest

Special | 10 problems | 9/10 verified | Difficulty - | 10m 26s

#	Problem	Time	✓
A	Accordion Artist And Orz Pandas	53s	✓
B	Bracelets of Orz Pandas	1m 19s	✓
C	Closestools of Orz Pandas	1m 1s	✓
D	Data Structure Master and Orz Pandas	1m 11s	✓
E	Encryption of Orz Pandas	59s	✓
F	Flow of Orz Pandas	1m 6s	✓
G	Gery's Problem and Orz Pandas	1m 24s	✓
H	Hamming Code and Orz Pandas	49s	✓
I	Irregular Shape of Orz Pandas	49s	✓
J	Junction of Orz Pandas	55s

Practice › Codeforces Solutions › 2020-2021 “Orz Panda” Cup Programming Contest ›

CF 102870B - Bracelets of Orz Pandas

We need count how much money can be earned by selling unique Orz Panda Bracelets of every possible length up to m. A bracelet has a circular arrangement of n positions around its side, with each position occupied by one rectangular block.

Practice › Codeforces Solutions › 2020-2021 “Orz Panda” Cup Programming Contest ›

CF 102870C - Closestools of Orz Pandas

We need simulate a row of n closestools, where pandas enter and leave over time. An entering panda chooses an empty closestool whose minimum distance to all currently occupied closestools is as large as possible.

Practice › Codeforces Solutions › 2020-2021 “Orz Panda” Cup Programming Contest ›

CF 102870J - Junction of Orz Pandas

I can write the editorial, but the problem statement content in your prompt is empty, so I do not have the full specification needed to produce a correct explanation, proof, algorithm, code, examples, and tests.

Practice › Codeforces Solutions › 2020-2021 “Orz Panda” Cup Programming Contest ›

CF 102870I - Irregular Shape of Orz Pandas

The problem gives the vertices of an irregular polygon in the order they appear around its boundary. Each vertex has integer coordinates. The task is to calculate the exact area enclosed by this polygon and print the result.

Practice › Codeforces Solutions › 2020-2021 “Orz Panda” Cup Programming Contest ›

CF 102870H - Hamming Code and Orz Pandas

The transmitted message is a Hamming encoded block. A block has 2^k bits, and the bits are indexed from 0 to 2^k - 1. The received block may have been modified by changing at most two bits.

Practice › Codeforces Solutions › 2020-2021 “Orz Panda” Cup Programming Contest ›

CF 102870G - Gery's Problem and Orz Pandas

The tree describes a network of vertices connected by edges. For a query containing two vertices u and v, we temporarily choose every vertex r as the root of the tree. In that rooted tree, we find the lowest common ancestor of u and v.

Practice › Codeforces Solutions › 2020-2021 “Orz Panda” Cup Programming Contest ›

CF 102870F - Flow of Orz Pandas

The problem models a water network with villages connected by bidirectional pipes. Each village consumes a fixed amount of water every day, and some villages contain unlimited water sources.

Practice › Codeforces Solutions › 2020-2021 “Orz Panda” Cup Programming Contest ›

CF 102870E - Encryption of Orz Pandas

The task is to simulate a special encryption process on an array. The array contains values that can be viewed bit by bit. One encryption round replaces every position with the XOR of all elements from the beginning of the array up to that position.

Practice › Codeforces Solutions › 2020-2021 “Orz Panda” Cup Programming Contest ›

CF 102870D - Data Structure Master and Orz Pandas

We have a rooted tree with node 1 as the root. During an infinite sequence of random operations, one node is chosen uniformly each time.

Practice › Codeforces Solutions › 2020-2021 “Orz Panda” Cup Programming Contest ›

CF 102870A - Accordion Artist And Orz Pandas

The task describes a row of adjacent buildings, where each building has a height and a width. Because the buildings touch each other, their front faces form one continuous skyline.