Codeforces Round 693 (Div. 3)

Solutions for Codeforces Round 693 (Div. 3) (contest 1472). 3/7 problems verified against sample I/O. Difficulty range: 800-2100.

7 items

Codeforces Round 693 (Div. 3)

Type: Div. 3 | Problems: 7 | Verified: 3/7 | Rating range: 800-2100 | Time: 28m 54s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Cards for Friends	800	greedy, math	1m 37s	✓
B	Fair Division	800	dp, greedy, math	5m 25s	✓
C	Long Jumps	1100	dp, graphs	2m 53s	✗
D	Even-Odd Game	1200	dp, games, greedy	1m 53s	✓
E	Correct Placement	1700	binary-search, data-structures, dp	3m 8s	✗
F	New Year's Puzzle	2100	brute-force, dp, graph-matchings	2m 29s	✗
G	Moving to the Capital	2100	dfs-and-similar, dp, graphs	11m 29s	✗

Practice › Codeforces Solutions › Codeforces Round 693 (Div. 3) ›

CF 1472G - Moving to the Capital

We are given a directed graph whose vertices are cities and whose root is city 1, the capital. For every city $v$, define $d[v]$ as the shortest path length from city 1 to $v$. These distances are fixed and known implicitly from the graph. Polycarp starts from some city $s$.

Practice › Codeforces Solutions › Codeforces Round 693 (Div. 3) ›

CF 1472E - Correct Placement

I can't reliably diagnose this one from the sample alone because the sample input/output pair does not identify the problem.

Practice › Codeforces Solutions › Codeforces Round 693 (Div. 3) ›

CF 1472F - New Year's Puzzle

We are given a strip of size 2 by n, representing two rows of cells. Some cells are blocked and cannot be used. Our goal is to cover all unblocked cells completely using dominoes of size 1×2 (horizontal) or 2×1 (vertical), without overlapping or extending beyond the strip.

Practice › Codeforces Solutions › Codeforces Round 693 (Div. 3) ›

CF 1472B - Fair Division

We have a collection of candies where each candy weighs either 1 or 2 grams. Alice and Bob want to split the candies so that the total weight each of them receives is exactly the same. The input for each test case gives the number of candies and their individual weights.

Practice › Codeforces Solutions › Codeforces Round 693 (Div. 3) ›

CF 1472D - Even-Odd Game

We are given an array of integers, and two players alternately remove elements from it. Alice starts first. Every time a player removes a number, only certain values actually contribute to their score: Alice gains points only from even numbers she picks, while Bob gains points…

Practice › Codeforces Solutions › Codeforces Round 693 (Div. 3) ›

CF 1472C - Long Jumps

I can't reliably diagnose this one from the sample alone because the sample input/output pair does not identify the problem.

Practice › Codeforces Solutions › Codeforces Round 693 (Div. 3) ›

CF 1472A - Cards for Friends

The task is to determine if a single sheet of paper of size w × h can be split into at least n smaller sheets using a strict set of cutting rules. Each cut is only allowed if the width or the height is even, and it produces two sheets of half the size along that dimension.