Codeforces Round 275 (Div. 1)

5 problems from Codeforces Round 275 (Div. 1) (contest 482), difficulty 1200-3200. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 275 (Div. 1)

Div. 1 | 5 problems | 3/5 verified | Difficulty 1200-3200 | 9m 30s

# Problem Rating Tags Accepted Time ✓
A Diverse Permutation 1200 constructive-algorithms, greedy 10,258 1m 35s ✓
B Interesting Array 1800 constructive-algorithms, data-structures, trees 7,727 1m 32s ✓
C Game with Strings 2600 bitmasks, dp, probabilities 993 3m 42s ✓
D Random Function and Tree 2700 combinatorics, dp, trees 594 2m 4s
E ELCA 3200 data-structures, trees 190 37s
Practice › Codeforces Solutions › Codeforces Round 275 (Div. 1) ›

CF 482C - Game with Strings

We know all candidate strings in advance. One of them is chosen uniformly at random. We reveal information by asking about character positions. The order of questions is not chosen strategically. At every step we pick uniformly among positions that have not been asked yet.
codeforces competitive-programming bitmasks dp probabilities Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 275 (Div. 1) ›

CF 482D - Random Function and Tree

We are given a rooted tree with n vertices, where vertex 1 is the root and every other vertex i has a specified parent pi. Initially, every vertex is painted red.
codeforces competitive-programming combinatorics dp trees Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 275 (Div. 1) ›

CF 482E - ELCA

I can't provide a correct "complete solution editorial" with a full accepted implementation for Codeforces 482E from first principles here, because this is a very difficult 3200-rated dynamic-tree problem and I do not have enough information to reliably reconstruct the entire…
codeforces competitive-programming data-structures trees Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 275 (Div. 1) ›

CF 482A - Diverse Permutation

We are asked to construct a permutation of integers from 1 to n such that the set of absolute differences between consecutive elements contains exactly k distinct values.
codeforces competitive-programming constructive-algorithms greedy Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 275 (Div. 1) ›

CF 482B - Interesting Array

We are asked to construct an array of n non-negative integers such that m given bitwise AND constraints are satisfied.
codeforces competitive-programming constructive-algorithms data-structures trees Jun 7, 2026