Codeforces Round 540 (Div. 3)

Solutions for Codeforces Round 540 (Div. 3) (contest 1118). 4/8 problems verified against sample I/O. Difficulty range: 800-2700.

8 items

Codeforces Round 540 (Div. 3)

Type: Div. 3 | Problems: 8 | Verified: 4/8 | Rating range: 800-2700 | Time: 14m 11s

Problem Name Rating Tags Solve Time Verified
A Water Buying 800 math 5m 23s ✗
B Tanya and Candies 1200 implementation 1m 15s ✓
C Palindromic Matrix 1700 constructive-algorithms, implementation 1m 26s ✗
D1 Coffee and Coursework (Easy version) 1700 brute-force, greedy 1m 8s ✓
D2 Coffee and Coursework (Hard Version) 1700 binary-search, greedy 1m 3s ✓
E Yet Another Ball Problem 1700 constructive-algorithms, implementation 1m 30s ✗
F1 Tree Cutting (Easy Version) 1800 dfs-and-similar, trees 1m 4s ✓
F2 Tree Cutting (Hard Version) 2700 combinatorics, dfs-and-similar, dp 1m 22s ✗
Practice › Codeforces Solutions › Codeforces Round 540 (Div. 3) ›

CF 1118A - Water Buying

Polycarp needs to buy exactly $n$ liters of water using bottles of two fixed sizes: 1-liter bottles at cost $a$ and 2-liter bottles at cost $b$. For each query, we are asked to determine the minimum total cost to acquire exactly $n$ liters.
codeforces competitive-programming math Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 540 (Div. 3) ›

CF 1118F2 - Tree Cutting (Hard Version)

We are given a tree with $n$ vertices. Each vertex is either colored with one of $k$ colors or left uncolored. The tree is connected, so there are $n-1$ edges. We are asked to select exactly $k-1$ edges and remove them, splitting the tree into $k$ components.
codeforces competitive-programming combinatorics dfs-and-similar dp trees Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 540 (Div. 3) ›

CF 1118E - Yet Another Ball Problem

We are tasked with assigning colors to dancers at a ball. There are n pairs, each consisting of a man and a woman, and k available colors.
codeforces competitive-programming constructive-algorithms implementation Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 540 (Div. 3) ›

CF 1118F1 - Tree Cutting (Easy Version)

We are given a tree with n vertices, where each vertex may be colored red, blue, or left uncolored. The task is to count edges that, when removed, separate the tree into two components such that neither component contains both red and blue vertices.
codeforces competitive-programming dfs-and-similar trees Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 540 (Div. 3) ›

CF 1118D2 - Coffee and Coursework (Hard Version)

Polycarp must write a coursework of m pages, but he cannot work indefinitely without caffeine. He has n cups of coffee, each with a caffeine dosage ai.
codeforces competitive-programming binary-search greedy Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 540 (Div. 3) ›

CF 1118D1 - Coffee and Coursework (Easy version)

We are given a collection of coffee cups, each with a fixed caffeine value. Polycarp can choose some of these cups and distribute them across several days.
codeforces competitive-programming brute-force greedy Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 540 (Div. 3) ›

CF 1118C - Palindromic Matrix

We are asked to arrange n^2 integers into an n x n square matrix so that the matrix is palindromic along both axes. A palindromic matrix does not change when we reverse the order of rows or reverse the order of columns.
codeforces competitive-programming constructive-algorithms implementation Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 540 (Div. 3) ›

CF 1118B - Tanya and Candies

We are given an array of weights where each index represents a candy. Tanya will remove exactly one candy and then consume the remaining candies strictly in index order, one per day starting from day 1.
codeforces competitive-programming implementation Jun 12, 2026