Codeforces Round 769 (Div. 2)

Solutions for Codeforces Round 769 (Div. 2) (contest 1632). 1/6 problems verified against sample I/O. Difficulty range: 800-2700.

6 items

Codeforces Round 769 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 1/6 | Rating range: 800-2700 | Time: 14m 1s

Problem Name Rating Tags Solve Time Verified
A ABC 800 implementation 2m 36s ✗
B Roof Construction 1000 bitmasks, constructive-algorithms 1m 45s ✗
C Strange Test 1600 binary-search, bitmasks, brute-force 3m 12s ✗
D New Year Concert 2000 binary-search, data-structures, greedy 3m 4s ✓
E1 Distance Tree (easy version) 2400 binary-search, data-structures, dfs-and-similar 1m 35s ✗
E2 Distance Tree (hard version) 2700 binary-search, dfs-and-similar, shortest-paths 1m 49s ✗
Practice › Codeforces Solutions › Codeforces Round 769 (Div. 2) ›

CF 1632E2 - Distance Tree (hard version)

We start with a tree of unit edges, rooted at vertex 1. The distance function $d(v)$ is simply the number of edges from node 1 to node $v$. So the quantity we care about initially is the height of the tree when rooted at 1.
codeforces competitive-programming binary-search dfs-and-similar shortest-paths trees Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 769 (Div. 2) ›

CF 1632D - New Year Concert

We are given a sequence of class performance lengths, where each length represents the duration of a scene prepared by a class.
codeforces competitive-programming binary-search data-structures greedy math number-theory two-pointers Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 769 (Div. 2) ›

CF 1632E1 - Distance Tree (easy version)

We are given a tree where every edge has weight 1, and we treat vertex 1 as the root. For every vertex, we define its distance as the shortest path length from vertex 1. The tree is initially fixed, but we are allowed to temporarily add one extra edge between any two vertices.
codeforces competitive-programming binary-search data-structures dfs-and-similar graphs shortest-paths trees Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 769 (Div. 2) ›

CF 1632C - Strange Test

We are given two integers, initially called $a$ and $b$, with $a < b$. In one move we are allowed to either increment one of them by one, or replace $a$ by the bitwise OR of $a$ and $b$.
codeforces competitive-programming binary-search bitmasks brute-force dp math Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 769 (Div. 2) ›

CF 1632A - ABC

This problem is rated 3500 and its solution relies on a fairly deep structural characterization of graphs whose cycle space admits a consistent cyclic orientation.
codeforces competitive-programming implementation Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 769 (Div. 2) ›

CF 1632B - Roof Construction

We are asked to arrange the heights of $n$ consecutive pillars such that the heights form a permutation of integers from $0$ to $n-1$. The goal is to minimize the maximum bitwise XOR of any two adjacent heights.
codeforces competitive-programming bitmasks constructive-algorithms Jun 10, 2026