TCPC Tunisian Collegiate Programming Contest 2022

14 problems from TCPC Tunisian Collegiate Programming Contest 2022 (contest 105020), difficulty -. 2/14 solutions verified against sample I/O.

14 items

TCPC Tunisian Collegiate Programming Contest 2022

Special | 14 problems | 2/14 verified | Difficulty - | 19m 1s

#	Problem	Time	✓
A	Mood	1m 17s
B	Hungry	1m 12s
C	Ice Coffee	1m 2s	✓
D	Beautiful decrease	1m 53s
E	The Detective Game	1m 3s
F	Distinct	1m 27s
G	String Rotation	1m 6s
H	Cookies	1m 13s
I	Omar and Trees	1m 53s
J	Hide and Seek	1m 12s
K	Wrong digits	1m 34s
L	Black and White Tree	1m 28s
M	Delivery	1m 24s	✓
N	How many rectangles?	1m 17s

Practice › Codeforces Solutions › TCPC Tunisian Collegiate Programming Contest 2022 ›

CF 105020N - How many rectangles?

Each rectangle in the input is fully determined by its bottom-left corner and its top-right corner. Because all rectangles start in the non-negative quadrant, the origin (0, 0) acts as a natural reference point. A query gives a point (x, y).

Practice › Codeforces Solutions › TCPC Tunisian Collegiate Programming Contest 2022 ›

CF 105020M - Delivery

We are asked to determine whether a given integer $x$ can be expressed as a sum of a contiguous block of positive integers starting from some $l$ and ending at $r$.

Practice › Codeforces Solutions › TCPC Tunisian Collegiate Programming Contest 2022 ›

CF 105020L - Black and White Tree

We are given a rooted tree where each node is painted either black or white. The tree structure defines parent-child relationships with node 1 as the root. For each query node $u$, we look only inside the subtree of $u$, meaning all nodes reachable by moving downward from $u$.

Practice › Codeforces Solutions › TCPC Tunisian Collegiate Programming Contest 2022 ›

CF 105020K - Wrong digits

Two long numbers are given as strings, and we are allowed to modify them digit by digit until they become identical. The catch is that digits are not treated as abstract values, but as seven-segment displays made of small “dashes”.

Practice › Codeforces Solutions › TCPC Tunisian Collegiate Programming Contest 2022 ›

CF 105020I - Omar and Trees

The problem gives a rooted tree where each node stores an integer value. The tree is fixed, but two operations are performed on it repeatedly. One operation overwrites every node in a chosen subtree with the same value.

Practice › Codeforces Solutions › TCPC Tunisian Collegiate Programming Contest 2022 ›

CF 105020J - Hide and Seek

Each test case describes a park with several trees, where each tree has a fixed height. Amr chooses one tree to hide behind. Whether he gets caught depends only on a comparison between his height and the height of that chosen tree.

Practice › Codeforces Solutions › TCPC Tunisian Collegiate Programming Contest 2022 ›

CF 105020H - Cookies

We are given several independent scenarios. In each scenario there are $n$ cookies in total, among which $a$ are large. Donia wants to eat some cookies, but she must avoid getting caught. The rule is that after she eats cookies, at least $m$ cookies must still remain uneaten.

Practice › Codeforces Solutions › TCPC Tunisian Collegiate Programming Contest 2022 ›

CF 105020G - String Rotation

We are given two strings of equal length. We are allowed to modify characters in the first string freely, but each modification costs one operation. After modifying, we do not compare it directly to the second string.

Practice › Codeforces Solutions › TCPC Tunisian Collegiate Programming Contest 2022 ›

CF 105020D - Beautiful decrease

We are given an array of positive integers. The array evolves through a sequence of queries, and each query allows a limited number of identical operations called “beautiful decreases”. A single beautiful decrease works on one contiguous segment of the array.

Practice › Codeforces Solutions › TCPC Tunisian Collegiate Programming Contest 2022 ›

CF 105020F - Distinct

We are given a sequence of instructions that transform a single integer variable starting from 1. Each instruction either doubles the current value or halves it using floor division.

Practice › Codeforces Solutions › TCPC Tunisian Collegiate Programming Contest 2022 ›

CF 105020E - The Detective Game

Each player in this game maintains a personal list of other players they would vote against if those players were put on trial.

Practice › Codeforces Solutions › TCPC Tunisian Collegiate Programming Contest 2022 ›

CF 105020A - Mood

We are given multiple independent scenarios where a person has a fixed amount of money and wants to buy a drink with a known price. For each scenario, we need to determine how much additional money is required so that the available amount is enough to cover the cost.

Practice › Codeforces Solutions › TCPC Tunisian Collegiate Programming Contest 2022 ›

CF 105020B - Hungry

We are given a single queue of customers already lined up at a shop. Each customer in the queue requires a known amount of time to be served, and the shop processes them strictly one after another.

Practice › Codeforces Solutions › TCPC Tunisian Collegiate Programming Contest 2022 ›

CF 105020C - Ice Coffee

We are given two arrays of integers of the same length. We are allowed to repeatedly transform elements, but only in one direction: each operation replaces a value by its largest proper divisor, meaning the greatest divisor strictly smaller than the number itself.