2023 Romanian Collegiate Programming Contest (RCPC)

13 problems from 2023 Romanian Collegiate Programming Contest (RCPC) (contest 104782), difficulty -. 13/13 solutions verified against sample I/O.

13 items

2023 Romanian Collegiate Programming Contest (RCPC)

Special | 13 problems | 13/13 verified | Difficulty - | 11m 56s

# Problem Rating Tags Accepted Time ✓
A Maximum Distance 47s ✓
B The floor is lava! 49s ✓
C Basketball 41s ✓
D Edenland 51s ✓
E Fiboxor 1m 1s ✓
F Suceava 1m 16s ✓
G Minimize Sum 49s ✓
H AI Thoughts 57s ✓
I KSumT 55s ✓
J Parallelogram 56s ✓
K Blabla 1m 7s ✓
L Dush 56s ✓
M Dragons 51s ✓
Practice › Codeforces Solutions › 2023 Romanian Collegiate Programming Contest (RCPC) ›

CF 104782L - Dush

We are given a small group of people who all need to take showers, but there is only one shower available. The shower is not always usable: time is divided into disjoint intervals during which water is flowing, and each interval also has a fixed water type.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023 Romanian Collegiate Programming Contest (RCPC) ›

CF 104782D - Edenland

We are given two sequences of processing times over a line of games. Alice always moves first, then Bob follows the same sequence of games in the same order. For each game, Alice spends some time on it and Bob spends his own time on it.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023 Romanian Collegiate Programming Contest (RCPC) ›

CF 104782J - Parallelogram

We are given several test cases. In each test case there is a collection of stick lengths. From this collection we want to know whether we can pick four distinct sticks such that, after freely rotating and rearranging them in the plane, they can form a parallelogram using all…
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023 Romanian Collegiate Programming Contest (RCPC) ›

CF 104782C - Basketball

We are asked to construct a target score using only two types of basketball throws: one type adds 2 points and the other adds 3 points. Given an integer n, we need to determine whether it is possible to form exactly n points using some combination of these throws.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023 Romanian Collegiate Programming Contest (RCPC) ›

CF 104782M - Dragons

The structure is a tree where each node has a fixed height. Each query gives two nodes, a starting node u, an ending node v, and a dragon power P. The dragon travels along the unique simple path between u and v.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023 Romanian Collegiate Programming Contest (RCPC) ›

CF 104782K - Blabla

We are given a static array and asked to count how many contiguous subarrays satisfy a geometric comparison between two different notions of “spread”.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023 Romanian Collegiate Programming Contest (RCPC) ›

CF 104782I - KSumT

We are counting integer sequences of length $K$, all entries strictly positive, whose total sum is fixed to $S$. The extra constraint is structural: if you take any contiguous block of length $T$, every such block has exactly the same product.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023 Romanian Collegiate Programming Contest (RCPC) ›

CF 104782H - AI Thoughts

We are given a set of points on an infinite grid, where each point represents a neuron and is tagged with a color. For each query, we are also given a sequence of colors.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023 Romanian Collegiate Programming Contest (RCPC) ›

CF 104782G - Minimize Sum

We are playing a game on a sequence of numbers using a deque that starts with a single value, zero. At each step, we process the next array element and are forced to interact with one of the two ends of the deque.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023 Romanian Collegiate Programming Contest (RCPC) ›

CF 104782F - Suceava

We are given a fixed tree of neighborhoods. Each road is initially controlled by some gang. Over time, roads change ownership: on each day, a specific road is taken over by another gang, meaning that from that day onward its controlling gang changes.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023 Romanian Collegiate Programming Contest (RCPC) ›

CF 104782E - Fiboxor

We are given a sequence defined by a recurrence that mixes arithmetic difference, absolute value, and bitwise XOR. The first two values are both 1, and every next value is computed from the previous two using a deterministic rule.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023 Romanian Collegiate Programming Contest (RCPC) ›

CF 104782B - The floor is lava!

We are given a rectangular grid where each cell has an integer height. Think of this grid as a terrain map. A number of people start at specified cells and can move one step per second in the four cardinal directions, or choose to stay still.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › 2023 Romanian Collegiate Programming Contest (RCPC) ›

CF 104782A - Maximum Distance

We are given two integer arrays of equal length and we are allowed to pick a contiguous segment from the first array and another contiguous segment from the second array. Both chosen segments must have the same length.
codeforces competitive-programming Jun 28, 2026