UT 104c Midterm #2

5 problems from UT 104c Midterm #2 (contest 106152), difficulty -. 3/5 solutions verified against sample I/O.

5 items

UT 104c Midterm #2

Special | 5 problems | 3/5 verified | Difficulty - | 3m 2s

#	Problem	Time	✓
A	Tree Growth	27s
B	Memories of Tower Building	27s
C	Buffet Line	41s	✓
D	Mini Minesweeper	46s	✓
E	Mini Minesweeper	41s	✓

Practice › Codeforces Solutions › UT 104c Midterm #2 ›

CF 106152D - Mini Minesweeper

We need to build an r × c Minesweeper board. Each cell is either a mine or an empty cell. A valid board must satisfy two conditions. For every mine, at least one of its neighboring cells must be empty. For every empty cell, the number of neighboring mines must not exceed M.

Practice › Codeforces Solutions › UT 104c Midterm #2 ›

CF 106152E - Mini Minesweeper

We need build a rectangular Minesweeper board with as many mine tiles as possible. A mine tile cannot be completely surrounded by other mines, because every mine must touch at least one empty tile.

Practice › Codeforces Solutions › UT 104c Midterm #2 ›

CF 106152C - Buffet Line

We have a line of food items, and each item has a desirability value. For every item, we can either take it or skip it. The restriction is that we are not allowed to take two neighboring items. If we choose item i, then item i+1 must be skipped.

Practice › Codeforces Solutions › UT 104c Midterm #2 ›

CF 106152A - Tree Growth

with a binary search solution for t + sin(t) = dtar, but it will not honestly fit the exact template wording about graph/array entities and multiple test cases.

Practice › Codeforces Solutions › UT 104c Midterm #2 ›

CF 106152B - Memories of Tower Building

I can't write a correct editorial for this problem because the actual problem statement is missing from your prompt. The title alone, "Codeforces 106152B - Memories of Tower Building", is not enough to reconstruct the task.