Финал региональной олимпиады «Машина Тьюринга» по программированию
5 problems from Финал региональной олимпиады «Машина Тьюринга» по программированию (contest 104221), difficulty -. 3/5 solutions verified against sample I/O.
Финал региональной олимпиады «Машина Тьюринга» по программированию
Special | 5 problems | 3/5 verified | Difficulty - | 5m 56s
CF 104221B - Динислам и столовая
We are given a line of students who must eventually “clear” their dishes, and each student contributes some amount of work measured in seconds. The initial situation contains a queue of $n$ existing students.
CF 104221E - Чайный магазин
We are given several possible positions for a shop along a straight line and a set of customers, each living at a fixed point and having a personal tolerance threshold.
CF 104221D - Карим и дороги
We are given an undirected simple graph with $n$ intersections and $m$ roads. Each road connects two distinct intersections, and between any pair of intersections there is at most one road.
CF 104221C - Кузя и день рождения
Kuzya is preparing a birthday party, but the number of guests he can invite depends entirely on how a cake is sliced at an unknown bakery. There are several bakeries in his city, and each bakery always cuts a cake into a fixed number of slices.