Codeforces Round 254 (Div. 1)

5 problems from Codeforces Round 254 (Div. 1) (contest 444), difficulty 1600-2700. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 254 (Div. 1)

Div. 1 | 5 problems | 3/5 verified | Difficulty 1600-2700 | 15m 35s

# Problem Rating Tags Accepted Time ✓
A DZY Loves Physics 1600 greedy, math 3,578 1m 32s ✓
B DZY Loves FFT 2300 probabilities 1,175 1m 51s ✓
C DZY Loves Colors 2400 data-structures 3,359 5m 19s
D DZY Loves Strings 2500 binary-search, hashing, strings 862 1m 6s ✓
E DZY Loves Planting 2700 binary-search, dsu, trees 856 5m 47s
Practice › Codeforces Solutions › Codeforces Round 254 (Div. 1) ›

CF 444E - DZY Loves Planting

We are given a tree with n nodes, where each edge has a positive weight. For any two nodes x and y, the function g(x, y) is defined as the maximum weight along the unique path connecting them.
codeforces competitive-programming binary-search dsu trees Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 254 (Div. 1) ›

CF 444C - DZY Loves Colors

We have a ribbon consisting of positions 1...n. Initially, position i has color i, so every position starts with a distinct color. Two kinds of operations are performed. A paint operation assigns a new color x to every position in a segment [l, r].
codeforces competitive-programming data-structures Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 254 (Div. 1) ›

CF 444B - DZY Loves FFT

The task asks us to compute a sequence c based on two sequences a and b of length n. Sequence a is a permutation of the integers from 1 to n, and b is a binary sequence with exactly d ones, both shuffled in a pseudo-random but reproducible way.
codeforces competitive-programming probabilities Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 254 (Div. 1) ›

CF 444A - DZY Loves Physics

We are given an undirected graph where each vertex carries a positive weight and each edge also carries a positive weight.
codeforces competitive-programming greedy math May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 254 (Div. 1) ›

CF 444D - DZY Loves Strings

We are given a long string s and a list of pairs of small strings (ai, bi). For each pair, we need to find the shortest substring of s that contains both ai and bi as substrings. If no substring contains both, we report -1.
codeforces competitive-programming binary-search hashing strings two-pointers May 29, 2026