Codeforces Round 1078 (Div. 2)

7 problems from Codeforces Round 1078 (Div. 2) (contest 2194), difficulty 800-3000. 2/7 solutions verified against sample I/O.

7 items

Codeforces Round 1078 (Div. 2)

Div. 2 | 7 problems | 2/7 verified | Difficulty 800-3000 | 13m 55s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Lawn Mower	800	greedy, math	23,804	1m 31s
B	Offshores	1000	greedy, implementation, math	18,381	2m 5s
C	Secret message	1300	bitmasks, brute-force, dp	10,883	1m 46s
D	Table Cut	1600	constructive-algorithms, greedy, implementation	7,835	2m 23s
E	The Turtle Strikes Back	2000	dp, graphs, greedy	2,607	2m 48s	✓
F1	Again Trees... (Easy Version)	2300	bitmasks, dfs-and-similar, dp	885	1m 35s	✓
F2	Again Trees... (hard version)	3000	bitmasks, data-structures, dfs-and-similar	167	1m 47s

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

CF 2194F2 - Again Trees... (hard version)

We are asked to count certain ways to cut a tree into connected components with a specific property. The tree has n vertices, each with a value av. We are also given a small set of numbers b1, ..., bk.

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

CF 2194E - The Turtle Strikes Back

We have a rectangular grid. Every cell contains an integer value, positive or negative. Michelangelo chooses a path from the top-left corner to the bottom-right corner. He may only move right or down.

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

CF 2194D - Table Cut

We are given a grid of size $n times m$ filled with zeros and ones. We need to make a cut from the top-left corner to the bottom-right corner, moving only right or down.

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

CF 2194F1 - Again Trees... (Easy Version)

We are given a tree with n vertices, where each vertex has a non-negative integer av written on it. We are also given a set of k distinct non-negative integers b1, ..., bk.

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

CF 2194B - Offshores

We are given several independent scenarios. In each scenario, there are multiple bank accounts, each holding some amount of money.

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

CF 2194C - Secret message

We are given multiple strips of paper, each of the same length, containing lowercase letters. Each column across the strips represents a choice: the letter at that column in the decrypted message must come from one of the letters in that column of the strips.

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

CF 2194A - Lawn Mower

We are given a fence made of $n$ unit-width boards arranged in a line. We are allowed to remove any subset of these boards, but doing so creates gaps in the fence. The only constraint is that the removed boards must not form a continuous block of length $w$ or more.