Testing Round #XVII

4 problems from Testing Round #XVII (contest 102646), difficulty -. 3/4 solutions verified against sample I/O.

4 items

Testing Round #XVII

Special | 4 problems | 3/4 verified | Difficulty - | 9m 36s

#	Problem	Time	✓
B	Combining Arrays	1m 54s	✓
C	Song Optimization	1m 26s
D	Team Selection	4m 18s	✓
E	Maximizing SCCs	1m 58s	✓

Practice › Codeforces Solutions › Testing Round #XVII ›

CF 102646C - Song Optimization

I can write the editorial, but the problem statement in your prompt is empty and the full requirements depend on the exact input/output details and samples.

Practice › Codeforces Solutions › Testing Round #XVII ›

CF 102646B - Combining Arrays

The task is to merge two queues of numbers into one array. The only operation allowed is taking the current first element from either queue and appending it to the answer. The internal order of each original array cannot change.

Practice › Codeforces Solutions › Testing Round #XVII ›

CF 102646E - Maximizing SCCs

We have a directed graph with n vertices and m edges. The original graph is guaranteed to be strongly connected, meaning every vertex can reach every other vertex using the given edges. We must keep exactly k of these edges and remove the rest.

Practice › Codeforces Solutions › Testing Round #XVII ›

CF 102646D - Team Selection

The problem models a basketball team selection process. There are n players standing in a fixed order, and player i has skill value a[i]. We must choose exactly k players while preserving their original order.