Codeforces Round 789 (Div. 2)

Solutions for Codeforces Round 789 (Div. 2) (contest 1678). 2/3 problems verified against sample I/O. Difficulty range: 800-1800.

3 items

Codeforces Round 789 (Div. 2)

Type: Div. 2 | Problems: 3 | Verified: 2/3 | Rating range: 800-1800 | Time: 6m 6s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Tokitsukaze and All Zero Sequence	800	implementation	1m 47s	✓
B1	Tokitsukaze and Good 01-String (easy version)	800	implementation	1m 30s	✓
B2	Tokitsukaze and Good 01-String (hard version)	1800	dp, greedy, implementation	2m 49s	✗

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

CF 1678B2 - Tokitsukaze and Good 01-String (hard version)

We are given a binary string of even length and asked to transform it into a "good" string. A good string is defined by two rules.

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

CF 1678A - Tokitsukaze and All Zero Sequence

The problem asks us to turn a sequence of numbers into all zeros using a particular operation. In each operation, we pick two distinct elements. If they are equal, we replace one of them with zero. If they are different, we replace both with the smaller of the two.

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

CF 1678B1 - Tokitsukaze and Good 01-String (easy version)

We are given a binary string and allowed to flip any individual character at unit cost. After all changes, the string is interpreted by compressing it into maximal runs of identical characters.