Sugar Sweet ❤️

8 problems from Sugar Sweet ❤️ (contest 104677), difficulty -. 7/8 solutions verified against sample I/O.

8 items

Sugar Sweet ❤️

Special | 8 problems | 7/8 verified | Difficulty - | 10m 31s

#	Problem	Time	✓
A	Pizza	56s	✓
B	War on Two Fronts	55s	✓
C	Darcy Parties	1m 2s	✓
D	Chase The Light	1m 9s	✓
E	Coding Club	1m 39s	✓
F	Etopika	2m 7s	✓
G	Points Redistribution	1m 5s	✓
H	Enchanted	1m 38s

Practice › Codeforces Solutions › Sugar Sweet ❤️ ›

CF 104677F - Etopika

The structure is a weighted tree with $N$ nodes, where node $1$ is the starting position of Bob. Each edge represents a bidirectional branch with a positive travel cost. Over $D$ days, two banana fruits appear at specified nodes each day.

Practice › Codeforces Solutions › Sugar Sweet ❤️ ›

CF 104677H - Enchanted

We are given a huge grid that is mostly empty, except for a small number of special cells called impurities. Each impurity sits at a fixed coordinate and contributes a possibly positive or negative strength value.

Practice › Codeforces Solutions › Sugar Sweet ❤️ ›

CF 104677B - War on Two Fronts

We are given two separate groups of five integers. Each group represents five people on one side of a classroom, and each person contributes a fixed number of points. Darcy is allowed to choose exactly one of the two groups.

Practice › Codeforces Solutions › Sugar Sweet ❤️ ›

CF 104677G - Points Redistribution

We are given a list of problems, each with a required time cost and a point value. The twist is that these problems are not always available. Instead, there are multiple classes, and each class teaches only a contiguous segment of problems.

Practice › Codeforces Solutions › Sugar Sweet ❤️ ›

CF 104677E - Coding Club

We are simulating a rectangular DVD logo moving inside a larger rectangular screen. The logo itself has width and height, so its motion is equivalent to tracking the bottom-left corner of a smaller rectangle that is constrained to move inside a reduced rectangle of size $(W-A)…

Practice › Codeforces Solutions › Sugar Sweet ❤️ ›

CF 104677D - Chase The Light

The graph describes a collection of islands connected by undirected bridges. Every bridge has two attributes: it always takes exactly one step to traverse it, and it also has a brightness value. From each query, an animal starts at some island and wants to reach island 1.

Practice › Codeforces Solutions › Sugar Sweet ❤️ ›

CF 104677C - Darcy Parties

We are given a group of people, each holding some number of cake slices. If the cake had been divided perfectly, every person would have received exactly the same number of slices, because the total number of slices is guaranteed to be divisible by the number of people.

Practice › Codeforces Solutions › Sugar Sweet ❤️ ›

CF 104677A - Pizza

The task describes a simple division scenario. A person has a fixed number of pizza slices and a group of friends. The slices are distributed as evenly as possible among all friends, and anything that cannot be evenly distributed remains unused.