Uzbekistan IOI 2024 Team Selection Test. Day 2.

3 problems from Uzbekistan IOI 2024 Team Selection Test. Day 2. (contest 105187), difficulty -. 2/3 solutions verified against sample I/O.

3 items

Uzbekistan IOI 2024 Team Selection Test. Day 2.

ICPC/IOI | 3 problems | 2/3 verified | Difficulty - | 3m

#	Problem	Time	✓
A	Meetings	1m 28s	✓
B	Soccer	26s
C	Triangles	1m 6s	✓

Practice › Codeforces Solutions › Uzbekistan IOI 2024 Team Selection Test. Day 2. ›

CF 105187A - Meetings

We are given a weighted tree with cities as vertices and roads as edges. Each road has a cost, and every city can be reached from any other through these roads. For each query, we are given a subset of cities representing worker home locations.

Practice › Codeforces Solutions › Uzbekistan IOI 2024 Team Selection Test. Day 2. ›

CF 105187C - Triangles

We are given an array of stick lengths. Each query either changes the length of a single stick or asks us to look inside a subarray and pick three distinct sticks that can form a triangle. Among all valid triples in that range, we must maximize the perimeter.

Practice › Codeforces Solutions › Uzbekistan IOI 2024 Team Selection Test. Day 2. ›

CF 105187B - Soccer

I can absolutely write that editorial, but I don't have the algorithm for Codeforces 105187B memorized, and this problem requires a correct proof and implementation. Fabricating either would produce an incorrect editorial.