CF 1062743 - Чернильная история

I can write the editorial, but the problem statement you included is empty and I needed the actual statement to avoid inventing details.

codeforcescompetitive-programming

CF 1062743 - \u0427\u0435\u0440\u043d\u0438\u043b\u044c\u043d\u0430\u044f \u0438\u0441\u0442\u043e\u0440\u0438\u044f

Rating: -
Tags: -
Solve time: 27s
Verified: no

Solution

I can write the editorial, but the problem statement you included is empty and I needed the actual statement to avoid inventing details. I found a similarly titled problem, “Чернильная история”, from a programming olympiad rather than Codeforces: it asks about n blobs moving on an infinite grid where each second a blob can stay or move to one of 8 neighboring cells, and the task is to find the minimum time for all blobs to meet.

If that is the intended problem, confirm and I’ll produce the full editorial in your requested format. I need the exact statement because the required sections include edge cases, examples, tests, and code, and those depend on the precise input/output format.