Codeforces Round 967 (Div. 2)

Solutions for Codeforces Round 967 (Div. 2) (contest 2001). 2/6 problems verified against sample I/O. Difficulty range: 800-2900.

6 items

Codeforces Round 967 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 800-2900 | Time: 20m 15s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Make All Equal	800	greedy, implementation	8m 5s	✓
B	Generate Permutation	800	constructive-algorithms	3m 18s	✓
C	Guess The Tree	1500	binary-search, brute-force, dfs-and-similar	3m 35s	✗
D	Longest Max Min Subsequence	1900	brute-force, constructive-algorithms, data-structures	3m 20s	✗
E1	Deterministic Heap (Easy Version)	2400	combinatorics, dp, math	46s	✗
E2	Deterministic Heap (Hard Version)	2900	combinatorics, dp, trees	1m 11s	✗

Practice › Codeforces Solutions › Codeforces Round 967 (Div. 2) ›

CF 2001A - Make All Equal

We are given an array of integers arranged cyclically, which means the first and last elements are considered adjacent.

Practice › Codeforces Solutions › Codeforces Round 967 (Div. 2) ›

CF 2001D - Longest Max Min Subsequence

We are asked to process a sequence of integers and find a subsequence that maximizes length while containing no repeated elements.

Practice › Codeforces Solutions › Codeforces Round 967 (Div. 2) ›

CF 2001E2 - Deterministic Heap (Hard Version)

We are asked to count deterministic max-heaps that can be formed on a perfect binary tree after performing a sequence of increment operations. The tree has height $n$, so it contains $2^n - 1$ nodes. Initially, all node values are zero.

Practice › Codeforces Solutions › Codeforces Round 967 (Div. 2) ›

CF 2001E1 - Deterministic Heap (Easy Version)

Codeforces 2001E1: Deterministic Heap (Easy Version)

Practice › Codeforces Solutions › Codeforces Round 967 (Div. 2) ›

CF 2001C - Guess The Tree

We are asked to reconstruct a hidden tree with n nodes by interacting with a judge that answers specific distance-based queries. Each query "? a b" returns the node x that minimizes the absolute difference in distances from a and b.

Practice › Codeforces Solutions › Codeforces Round 967 (Div. 2) ›

CF 2001B - Generate Permutation

We are asked to construct a permutation of integers from 1 to $n$ such that, no matter which of two typewriters Misuki uses, the number of required carriage returns to complete the permutation is identical.