Codeforces Round 611 (Div. 3)

5 problems from Codeforces Round 611 (Div. 3) (contest 1283), difficulty 900-2200. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 611 (Div. 3)

Div. 3 | 5 problems | 3/5 verified | Difficulty 900-2200 | 30m 30s

# Problem Rating Tags Accepted Time ✓
B Candies Division 900 math 23,081 5m 8s ✓
C Friends and Gifts 1500 constructive-algorithms, data-structures, math 14,153 1m 32s ✓
D Christmas Trees 1800 graphs, greedy, shortest-paths 9,438 5m 22s
E New Year Parties 1800 dp, greedy 7,325 11m 52s ✓
F DIY Garland 2200 constructive-algorithms, greedy, trees 2,043 6m 36s
Practice › Codeforces Solutions › Codeforces Round 611 (Div. 3) ›

CF 1283E - New Year Parties

We are given a set of people placed on integer points on a line. Each person starts at a fixed coordinate and is allowed to move at most one step left, stay where they are, or move one step right.
codeforces competitive-programming dp greedy Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 611 (Div. 3) ›

CF 1283F - DIY Garland

We are given a tree with $n$ vertices, where each vertex represents a lamp. One of these lamps is directly connected to a power source, and from it power spreads through directed connections formed by the wires of the tree.
codeforces competitive-programming constructive-algorithms greedy trees Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 611 (Div. 3) ›

CF 1283D - Christmas Trees

We are given a set of fixed points on a number line, each representing a Christmas tree. We are also asked to place another set of points representing people, but with a twist: each person contributes cost equal to the distance to the nearest tree, and we want to choose all…
codeforces competitive-programming graphs greedy shortest-paths Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 611 (Div. 3) ›

CF 1283B - Candies Division

We are distributing a fixed number of identical candies among a fixed number of children. Each child must receive a non-negative integer number of candies, and we are allowed to leave some candies unused.
codeforces competitive-programming math Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 611 (Div. 3) ›

CF 1283C - Friends and Gifts

We are given a directed assignment problem on $n$ people where each person must end up choosing exactly one other person to give a gift to, and at the same time must receive exactly one gift from someone else.
codeforces competitive-programming constructive-algorithms data-structures math Jun 11, 2026