The 2024 Syrian Virtual University Collegiate Programming Contest
13 problems from The 2024 Syrian Virtual University Collegiate Programming Contest (contest 105264), difficulty -. 13/13 solutions verified against sample I/O.
The 2024 Syrian Virtual University Collegiate Programming Contest
Special | 13 problems | 13/13 verified | Difficulty - | 13m 32s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Goals, Goals! Everywhere | 58s | ✓ | |||
| B | Depth Range Update | 1m 34s | ✓ | |||
| C | Variety Hater | 1m 9s | ✓ | |||
| D | Make It Minimum | 1m 3s | ✓ | |||
| E | Changes in Antwanland | 52s | ✓ | |||
| F | Tree XOR | 1m 19s | ✓ | |||
| G | The Elden Program | 1m 13s | ✓ | |||
| H | Good Array | 48s | ✓ | |||
| I | Homies and Not Homies | 58s | ✓ | |||
| J | Game of Primes | 47s | ✓ | |||
| K | Minimum Sum | 1m 25s | ✓ | |||
| L | The Shrine of the Father of Forces | 49s | ✓ | |||
| M | Kaaa | 37s | ✓ |
CF 105264B - Depth Range Update
We are given a rooted tree with node 1 as the root, and each node carries a value. The depth of a node is its distance from the root in edges. Two operations are performed.
CF 105264M - Kaaa
We are given a single short string representing what Mohanad hears at 8am. The task is to decide whether this exact sound matches a very specific pattern associated with the crow: the string must be exactly three repetitions of the substring “Kaaa”, with no extra characters…
CF 105264K - Minimum Sum
We are given a list of $n$ very large integers, each written as an $n$-digit string (leading zeros are allowed, so we treat them as fixed-length numbers rather than variable-length integers). We process indices from $1$ to $n$ in increasing order.
CF 105264L - The Shrine of the Father of Forces
We are asked to count how many permutations of the numbers from 1 to n satisfy a structured constraint involving the positions of elements. The array is indexed from 0, and n is always odd. The positions are split into odd and even indices.
CF 105264J - Game of Primes
We are given a multiset of integers. There is a second multiset that starts empty. Two players alternately remove an element from the first multiset.
CF 105264I - Homies and Not Homies
Each test case gives a number $n$, and we conceptually build rows numbered from $1$ to $n$. Row $i$ is the binary representation of $i$, written without leading zeros, and each bit corresponds to a bulb that is either on (1) or off (0).
CF 105264H - Good Array
We are given an array of positive integers. We are allowed to repeatedly perform a special operation that redistributes powers of two between elements: pick an index whose value is even, reduce it by half, and simultaneously double another element.
CF 105264F - Tree XOR
We are given a tree where each vertex carries a small integer value (at most 63). The task is to select some vertices that form a connected subgraph and make the bitwise XOR of their values equal to a target number $k$.
CF 105264G - The Elden Program
We are given a row of monsters, each with a fixed power value. For each test case, we are asked to imagine a scenario where we choose one monster as a “target” that is frozen in place.
CF 105264D - Make It Minimum
We are given a string of digits. From it, every adjacent pair of characters forms a two-digit number, and the sum of all such pair values defines a score. For a string s = s1 s2 ...
CF 105264E - Changes in Antwanland
We are given a tree with n vertices. We are allowed to keep exactly k vertices and consider the subgraph they induce. Since the chosen vertices must still form a connected tree, the selection is effectively constrained to a connected k-node subtree of the original tree.
CF 105264C - Variety Hater
We are given an array of integers, and we are allowed to perform a limited number of unit adjustments. Each operation picks a single position and increases or decreases that value by exactly one.
CF 105264A - Goals, Goals! Everywhere
We are given a team where each player reports a number of “contributions”. A contribution is either a goal scored or an assist that helped another player score a goal. Every goal has exactly one scorer, and it may optionally have one assistant.