Aleppo Collegiate Programming Contest 2023 V.2

13 problems from Aleppo Collegiate Programming Contest 2023 V.2 (contest 104544), difficulty -. 3/13 solutions verified against sample I/O.

13 items

Aleppo Collegiate Programming Contest 2023 V.2

Special | 13 problems | 3/13 verified | Difficulty - | 23m 19s

#	Problem	Time	✓
A	Eh Seedie, Hot Bel Kherej	1m 53s	✓
B	The Good Judge	2m 8s	✓
C	K-th LNCA	1m 41s
D	For A Few Dollars More	1m 31s
E	Bad Luck Blackie	1m 59s
F	The Birthday Present	2m 3s
G	Now I Know You Are Blind Man, But You Gotta See This	1m 27s
H	Obada's Problem	1m 20s
I	At War With The Army	3m 4s
J	The Set Terminator	2m 21s
K	The Backrooms	1m 29s
L	The Washing Machine Monster	58s	✓
M	Be Aware of Your Profile Picture	1m 25s

Practice › Codeforces Solutions › Aleppo Collegiate Programming Contest 2023 V.2 ›

CF 104544M - Be Aware of Your Profile Picture

We are given several test cases. In each test case, there are $n$ squads and $k$ employee types. Each squad is encoded as a bitmask of length $k$, where bit $j$ indicates whether that squad currently contains an employee of type $j$.

Practice › Codeforces Solutions › Aleppo Collegiate Programming Contest 2023 V.2 ›

CF 104544L - The Washing Machine Monster

We are given a number of socks and asked to determine how many complete pairs can be formed. A pair consists of exactly two socks, so the task reduces to grouping socks into disjoint groups of size two and counting how many such groups can be made.

Practice › Codeforces Solutions › Aleppo Collegiate Programming Contest 2023 V.2 ›

CF 104544I - At War With The Army

This failure is no longer about the algorithm itself, but about input parsing, and it is happening before any logic runs. The crash is: That means the program expected the first token to be the number of test cases t, but instead it directly received a line containing array data.

Practice › Codeforces Solutions › Aleppo Collegiate Programming Contest 2023 V.2 ›

CF 104544J - The Set Terminator

We start with a multiset of integers between 1 and m. Then q times we append a new value and immediately delete the k-th smallest element of the current multiset. After each operation, the multiset size stays constant, because one element is inserted and one is removed.

Practice › Codeforces Solutions › Aleppo Collegiate Programming Contest 2023 V.2 ›

CF 104544K - The Backrooms

We are given a connected undirected graph with $n$ rooms and $m$ passages. Moussa starts at room $1$ and wants to reach room $n$.

Practice › Codeforces Solutions › Aleppo Collegiate Programming Contest 2023 V.2 ›

CF 104544H - Obada's Problem

We are given a permutation of length $n$, and we want to think about how hard it is to sort it using a very specific type of operation.

Practice › Codeforces Solutions › Aleppo Collegiate Programming Contest 2023 V.2 ›

CF 104544G - Now I Know You Are Blind Man, But You Gotta See This

We are given an array of integers, and we conceptually look at every possible subsequence of this array. For each subsequence, we take the set of values it contains and compute its MEX, the smallest non-negative integer that does not appear in that set.

Practice › Codeforces Solutions › Aleppo Collegiate Programming Contest 2023 V.2 ›

CF 104544F - The Birthday Present

We are given an array of integers and a modulus value. From this array, every contiguous subarray is considered, and each subarray is assigned a value equal to the sum of its elements taken modulo $m$.

Practice › Codeforces Solutions › Aleppo Collegiate Programming Contest 2023 V.2 ›

CF 104544E - Bad Luck Blackie

We are given two arrays of length $n$. One array represents current “values” of positions, and the second array represents how each position evolves over time. We also have a process that runs for $k$ seconds.

Practice › Codeforces Solutions › Aleppo Collegiate Programming Contest 2023 V.2 ›

CF 104544D - For A Few Dollars More

We are asked to decide how cheaply Yazan can order two dishes, one for each friend, under two constraints. The first dish has cost a and must be at least x. The second dish has cost b and is tied to the total bill: it must be at least y% of the combined cost a + b.

Practice › Codeforces Solutions › Aleppo Collegiate Programming Contest 2023 V.2 ›

CF 104544B - The Good Judge

We are given two integer arrays of equal length. In each test case, we can perform operations that scale an entire array by multiplying all its elements by some integer factor. We can repeat this any number of times, and each multiplication counts as one operation.

Practice › Codeforces Solutions › Aleppo Collegiate Programming Contest 2023 V.2 ›

CF 104544A - Eh Seedie, Hot Bel Kherej

We are given a large list of integers and a target number $x$. From the list, we may choose any subset of elements. The value of a subset is defined by multiplying all its chosen numbers together.

Practice › Codeforces Solutions › Aleppo Collegiate Programming Contest 2023 V.2 ›

CF 104544C - K-th LNCA

We are given a rooted tree with node 1 as the root. Each query selects a subset of distinct nodes, and we are asked to analyze how “deep” common ancestors can be formed when we take groups of exactly k nodes from that subset.