Codeforces Round 254 (Div. 1)

Solutions for Codeforces Round 254 (Div. 1) (contest 444). 2/3 problems verified against sample I/O. Difficulty range: 1600-2700.

3 items

Codeforces Round 254 (Div. 1)

Type: Div. 1 | Problems: 3 | Verified: 2/3 | Rating range: 1600-2700 | Time: 4m 8s

Problem Name Rating Tags Solve Time Verified
A DZY Loves Physics 1600 greedy, math 1m 32s ✓
D DZY Loves Strings 2500 binary-search, hashing, strings 1m 6s ✓
E DZY Loves Planting 2700 binary-search, dsu, trees 1m 30s ✗
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
Practice › Codeforces Solutions › Codeforces Round 254 (Div. 1) ›

CF 444E - DZY Loves Planting

We are given a weighted tree where every edge has a cost, and we can think of it as a structure connecting n labeled nodes. Between any two nodes x and y, there is exactly one simple path, and we define a function g(x, y) as the largest edge weight along that path.
codeforces competitive-programming binary-search dsu trees May 29, 2026