Codeforces Round 742 (Div. 2)

Solutions for Codeforces Round 742 (Div. 2) (contest 1567). 2/6 problems verified against sample I/O. Difficulty range: 800-2700.

6 items

Codeforces Round 742 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 800-2700 | Time: 17m 50s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Domino Disaster	800	implementation, strings	1m 49s	✓
B	MEXor Mixup	1000	bitmasks, greedy	8m 6s	✗
C	Carrying Conundrum	1600	bitmasks, combinatorics, dp	1m 47s	✗
D	Expression Evaluation Error	2000	constructive-algorithms, greedy, implementation	1m 31s	✗
E	Non-Decreasing Dilemma	2200	data-structures, divide-and-conquer, math	2m 19s	✓
F	One-Four Overload	2700	2-sat, constructive-algorithms, dfs-and-similar	2m 18s	✗

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

CF 1567B - MEXor Mixup

Ah, I see exactly what went wrong. The traceback shows: This happened because in the test harness we called solve() but in your actual script the function solve wasn’t defined in the global scope or the script wasn’t executed properly inside the harness.

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

CF 1567F - One-Four Overload

We are given a grid of size $n times m$ where some cells are marked with an X and the rest are unmarked .. The marked cells are never on the boundary of the grid.

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

CF 1567E - Non-Decreasing Dilemma

We maintain an array under point updates. After each update, future queries must use the new values. For a query on a segment [l, r], we must count how many subarrays completely inside that range are non-decreasing.

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

CF 1567D - Expression Evaluation Error

We are given a situation where Bob writes down a sequence of positive integers whose sum is fixed. The only freedom he has is how to split this total sum into exactly n parts.

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

CF 1567A - Domino Disaster

We are given a 2-row grid of width $n$ fully covered by $1 times 2$ dominoes. Each domino can be placed either vertically, covering one cell in each row, or horizontally, covering two adjacent cells in the same row.

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

CF 1567C - Carrying Conundrum

We are asked to count the number of ordered pairs of positive integers (a, b) that produce a specific result n under an unusual addition scheme. In this scheme, instead of carrying to the next column as in standard addition, Alice carries to the column two places to the left.