Codeforces Round 722 (Div. 1)

Solutions for Codeforces Round 722 (Div. 1) (contest 1528). 3/6 problems verified against sample I/O. Difficulty range: 1600-3300.

6 items

Codeforces Round 722 (Div. 1)

Type: Div. 1 | Problems: 6 | Verified: 3/6 | Rating range: 1600-3300 | Time: 26m

Problem Name Rating Tags Solve Time Verified
A Parsa's Humongous Tree 1600 dfs-and-similar, divide-and-conquer, dp 2m 53s ✗
B Kavi on Pairing Duty 1700 combinatorics, dp, math 11m 8s ✓
C Trees of Tranquillity 2300 data-structures, dfs-and-similar, greedy 3m 12s ✓
D It's a bird! No, it's a plane! No, it's AaParsa! 2500 constructive-algorithms, graphs, shortest-paths 2m 27s ✗
E Mashtali and Hagh Trees 2900 combinatorics, dp, trees 3m 1s ✗
F AmShZ Farm 3300 combinatorics, fft, math 3m 19s ✓
Practice › Codeforces Solutions › Codeforces Round 722 (Div. 1) ›

CF 1528B - Kavi on Pairing Duty

We are asked to count the number of ways to pair $2n$ points arranged on a straight line such that every pair of segments either has one segment fully inside the other or both segments are of equal length.
codeforces competitive-programming combinatorics dp math Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 722 (Div. 1) ›

CF 1528F - AmShZ Farm

The problem defines a special class of arrays of length $n$ whose entries lie in $[1,n]$. Such an array is called “more-equal” if we can increase each element independently by some non-negative amount so that the resulting array becomes a permutation of $1..n$.
codeforces competitive-programming combinatorics fft math Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 722 (Div. 1) ›

CF 1528E - Mashtali and Hagh Trees

We are asked to count the number of different unlabeled Hagh trees of a given height $n$. A Hagh tree is a rooted directed tree with three key properties: its longest directed path has length exactly $n$, every vertex has degree at most three, and any pair of vertices that are…
codeforces competitive-programming combinatorics dp trees Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 722 (Div. 1) ›

CF 1528D - It's a bird! No, it's a plane! No, it's AaParsa!

We are asked to compute the shortest travel times between all pairs of cities in a land with $n$ cities, where each city contains at least one transport cannon.
codeforces competitive-programming constructive-algorithms graphs shortest-paths Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 722 (Div. 1) ›

CF 1528C - Trees of Tranquillity

We are given two rooted trees on the same set of vertices 1..n. Both trees are rooted at vertex 1. From these two trees we define a graph. Two vertices are connected if they satisfy two conditions simultaneously.
codeforces competitive-programming data-structures dfs-and-similar greedy trees Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 722 (Div. 1) ›

CF 1528A - Parsa's Humongous Tree

We are given a tree with n vertices. On each vertex, there is a range [lv, rv] of integers that can be assigned. We need to assign a number av to each vertex within its range so that the sum of absolute differences along all edges is maximized.
codeforces competitive-programming dfs-and-similar divide-and-conquer dp greedy trees Jun 10, 2026