4inazezContest

4 problems from 4inazezContest (contest 105831), difficulty -. 4/4 solutions verified against sample I/O.

4 items

4inazezContest

Special | 4 problems | 4/4 verified | Difficulty - | 3m 27s

#	Problem	Time	✓
A	\u0424\u0438\u043a\u0441\u0438\u043a\u0438 \u0438 \u043f\u0430\u0440\u043e\u0432\u043e\u0439 \u0434\u0432\u0438\u0433\u0430\u0442\u0435\u043b\u044c	39s	✓
B	\u0410\u043b\u0435\u0441\u0430\u043d\u0434\u0440	58s	✓
C	\u041a\u043e\u0442, \u043e\u0433\u043e\u043d\u044c \u0438 \u0432\u043e\u0434\u0430	1m 5s	✓
D	\u041f\u0440\u043e\u0441\u0442\u043e \u0434\u0435\u0440\u0435\u0432\u043e	45s	✓

Practice › Codeforces Solutions › 4inazezContest ›

CF 105831D - Просто дерево

We are given a tree where each vertex carries a value. We are also given a threshold value c. From all simple paths in the tree, we only care about those paths where the values on the path are not “too extreme” in the sense that the minimum value on the path is at most c and…

Practice › Codeforces Solutions › 4inazezContest ›

CF 105831C - Кот, огонь и вода

We are given a fixed array of house heights. Each query paints a contiguous interval of houses. After a painting, we are asked how many “firefighter operations” are needed to extinguish all burning houses in that interval.

Practice › Codeforces Solutions › 4inazezContest ›

CF 105831A - Фиксики и паровой двигатель

We are given an even number of participants, each with a nonzero integer value representing their efficiency. We must pair them up so that every participant is used in exactly one pair.

Practice › Codeforces Solutions › 4inazezContest ›

CF 105831B - Алесандр

We are given a directed graph with n nodes and exactly n − 1 directed edges. Each edge x → y means that the butterfly numbered x considers y its friend.