USI-Team-Selection 2023-2024

6 problems from USI-Team-Selection 2023-2024 (contest 104886), difficulty -. 4/6 solutions verified against sample I/O.

6 items

USI-Team-Selection 2023-2024

Special | 6 problems | 4/6 verified | Difficulty - | 4m 19s

#	Problem	Time	✓
A	Schedule Problem	49s	✓
B	Easy Geometry	47s	✓
C	Fair Grading	55s	✓
D	GCD Counting	49s	✓
E	Random Tree Path Match	29s
F	Interval removal	30s

Practice › Codeforces Solutions › USI-Team-Selection 2023-2024 ›

CF 104886D - GCD Counting

We are given multiple test cases. In each one, we receive an array of positive integers bounded by a limit $m$. The task is not to construct anything, but to count.

Practice › Codeforces Solutions › USI-Team-Selection 2023-2024 ›

CF 104886F - Interval removal

The material you provided does not include the actual problem statement. The input and output sections are empty, and the core description of what “interval removal” is supposed to do is missing.

Practice › Codeforces Solutions › USI-Team-Selection 2023-2024 ›

CF 104886E - Random Tree Path Match

We are given a rooted tree with a weight on every vertex. For each query, we look at two nodes, take the unique simple path from the root to each of them, and then try to “align” these two root-to-node paths.

Practice › Codeforces Solutions › USI-Team-Selection 2023-2024 ›

CF 104886C - Fair Grading

We are given a list of professors, each of whom assigns a score to a student. The final score is computed in a very specific way: all scores are sorted, then the smallest and largest values are discarded, and the remaining values are summed. There is one allowed intervention.

Practice › Codeforces Solutions › USI-Team-Selection 2023-2024 ›

CF 104886A - Schedule Problem

The task is to determine whether a given time schedule is feasible by checking if all required time intervals can be satisfied simultaneously.

Practice › Codeforces Solutions › USI-Team-Selection 2023-2024 ›

CF 104886B - Easy Geometry

The brute-force view is to treat the river contact point as a variable point $P = (x, 0)$ and minimize the function $$f(x) = sqrt{(x-x1)^2 + y1^2} + sqrt{(x-x2)^2 + y2^2}.