Codeforces Round 763 (Div. 2)

Solutions for Codeforces Round 763 (Div. 2) (contest 1623). 1/5 problems verified against sample I/O. Difficulty range: 800-2500.

5 items

Codeforces Round 763 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 1/5 | Rating range: 800-2500 | Time: 11m 45s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Robot Cleaner	800	brute-force, implementation, math	1m 24s	✓
B	Game on Ranges	1100	brute-force, dfs-and-similar, implementation	4m 55s	✗
C	Balanced Stone Heaps	1600	binary-search, greedy	1m 43s	✗
D	Robot Cleaner Revisit	2300	implementation, math, probabilities	1m 57s	✗
E	Middle Duplication	2500	data-structures, dfs-and-similar, greedy	1m 46s	✗

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

CF 1623B - Game on Ranges

Ah, now the problem is clear. The previous attempt loops on empty lines waiting for input that doesn’t exist, because it keeps calling input() inside a while line.strip() == '' loop. On large or malformed input, this can hang forever, causing a timeout.

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

CF 1623E - Middle Duplication

We are given a rooted binary tree where each node stores a single lowercase character. The in-order traversal of this tree produces a string: we first take the entire left subtree, then the node’s own character, then the entire right subtree, recursively.

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

CF 1623D - Robot Cleaner Revisit

A robot moves deterministically inside an $n times m$ grid, bouncing off walls like a billiard ball. Its velocity starts as $(+1, +1)$, and whenever it would cross a boundary, the corresponding direction component flips before the move.

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

CF 1623C - Balanced Stone Heaps

We are given a sequence of stone piles. In a single left-to-right sweep starting from the third pile, we are allowed to redistribute stones from each pile to the two previous piles in a fixed ratio: if we choose an amount $d$, we remove $3d$ stones from the current pile, add…

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

CF 1623A - Robot Cleaner

We have a robot moving inside a rectangular room with $n$ rows and $m$ columns. The robot starts at some cell $(rb, cb)$ and moves diagonally: one step down and one step right at a time.