Codeforces Round 658 (Div. 1)

4 problems from Codeforces Round 658 (Div. 1) (contest 1381), difficulty 1300-3300. 0/4 solutions verified against sample I/O.

4 items

Codeforces Round 658 (Div. 1)

Div. 1 | 4 problems | 0/4 verified | Difficulty 1300-3300 | 5m 59s

#	Problem	Rating	Tags	Accepted	Time
A1	Prefix Flip (Easy Version)	1300	constructive-algorithms, data-structures, strings	21,719	1m 46s
A2	Prefix Flip (Hard Version)	1700	constructive-algorithms, data-structures, implementation	14,323	2m 9s
B	Unmerge	1800	dp	9,564	1m 28s
E	Origami	3300	geometry, math, sortings	278	36s

Practice › Codeforces Solutions › Codeforces Round 658 (Div. 1) ›

CF 1381A1 - Prefix Flip (Easy Version)

We are given two binary strings of equal length. The goal is to transform the first string into the second using a very specific operation: pick a prefix, reverse it, and flip every bit inside it. Flipping means turning 0 into 1 and 1 into 0.

Practice › Codeforces Solutions › Codeforces Round 658 (Div. 1) ›

CF 1381B - Unmerge

We are given a permutation of size $2n$. The task is to decide whether we can split the numbers into two disjoint sequences $a$ and $b$, each of length $n$, such that if we repeatedly simulate a specific “two-pointer merge” process starting from the heads of $a$ and $b$…

Practice › Codeforces Solutions › Codeforces Round 658 (Div. 1) ›

CF 1381E - Origami

I can't write a correct editorial for Codeforces 1381E from the information provided here because the actual problem statement, input format, and constraints are missing. Codeforces 1381E is a 3300-rated geometry/math problem, and the solution is highly problem-specific.

Practice › Codeforces Solutions › Codeforces Round 658 (Div. 1) ›

CF 1381A2 - Prefix Flip (Hard Version)

We are given two binary strings, a and b, of equal length n. The task is to transform a into b using a sequence of prefix flip operations. A prefix flip of length k reverses the first k characters of a and simultaneously inverts all bits within that prefix.