Codeforces Round 772 (Div. 2)

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

6 items

Codeforces Round 772 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 1/6 | Rating range: 800-2800 | Time: 11m 13s

Problem Name Rating Tags Solve Time Verified
A Min Or Sum 800 bitmasks, greedy 1m 9s ✓
B Avoid Local Maximums 800 greedy 2m 2s ✗
C Differential Sorting 1200 constructive-algorithms, greedy 1m 53s ✗
D Infinite Set 1800 bitmasks, dp, math 2m 41s ✗
E Cars 2200 2-sat, constructive-algorithms, dfs-and-similar 1m 50s ✗
F Closest Pair 2800 data-structures, greedy 1m 38s ✗
Practice › Codeforces Solutions › Codeforces Round 772 (Div. 2) ›

CF 1635D - Infinite Set

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 bitmasks dp math matrices number-theory strings Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 772 (Div. 2) ›

CF 1635E - Cars

We are asked to reconstruct a hidden configuration of points on a line, one for each car, and assign each car a direction, left or right. After reconstruction, the configuration must explain two kinds of pairwise constraints.
codeforces competitive-programming 2-sat constructive-algorithms dfs-and-similar dsu graphs greedy sortings Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 772 (Div. 2) ›

CF 1635F - Closest Pair

We are given a sequence of points lying on a horizontal line, each with a coordinate and a positive weight. The task is to answer multiple queries about contiguous subarrays of these points.
codeforces competitive-programming data-structures greedy Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 772 (Div. 2) ›

CF 1635B - Avoid Local Maximums

We have to modify an array so that no position is strictly greater than both of its neighbors. Such positions are called local maximums. The first and last elements are never local maximums because they only have one neighbor.
codeforces competitive-programming greedy Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 772 (Div. 2) ›

CF 1635C - Differential Sorting

We are given an integer array and we are allowed to perform a very specific transformation: pick three indices in increasing order and overwrite the leftmost position with the difference of the two later values.
codeforces competitive-programming constructive-algorithms greedy Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 772 (Div. 2) ›

CF 1635A - Min Or Sum

We are given several arrays, each containing small non-negative integers. For each array, we are allowed to repeatedly pick two different positions and replace both values with new numbers, as long as the bitwise OR of the chosen pair stays unchanged after the replacement.
codeforces competitive-programming bitmasks greedy Jun 10, 2026