Algorithms Thread Treaps Contest

7 problems from Algorithms Thread Treaps Contest (contest 102787), difficulty -. 6/7 solutions verified against sample I/O.

7 items

Algorithms Thread Treaps Contest

Special | 7 problems | 6/7 verified | Difficulty - | 8m 26s

#	Problem	Time	✓
A	Shandom Ruffle	1m 5s	✓
B	Pear TreaP	1m 24s	✓
C	Sneetches and Speeches 3	1m 6s	✓
D	The Grim Treaper	1m 6s
E	Sneetches and Speeches 2	1m 15s	✓
Y	Sneetches and Speeches 1	1m 27s	✓
Z	Trick or Treap	1m 3s	✓

Practice › Codeforces Solutions › Algorithms Thread Treaps Contest ›

CF 102787C - Sneetches and Speeches 3

We maintain a binary string representing sneetches. A character 0 means a sneetch has no star and 1 means it has a star. The string changes through three types of operations. The first operation flips every character in a chosen interval.

Practice › Codeforces Solutions › Algorithms Thread Treaps Contest ›

CF 102787A - Shandom Ruffle

The problem describes a sequence of n tiles initially arranged as 1, 2, 3, ..., n. We are given n shuffle operations. Each operation receives two positions a and b. If b is not after a, nothing happens.

Practice › Codeforces Solutions › Algorithms Thread Treaps Contest ›

CF 102787Z - Trick or Treap

The problem maintains a collection of ordered groups of treap nodes. A node is created with a value, and its identifier is the query number that created it.

Practice › Codeforces Solutions › Algorithms Thread Treaps Contest ›

CF 102787Y - Sneetches and Speeches 1

The problem tracks a line of sneetches, where each sneetch has either zero or one star. A query selects a continuous interval and sends those sneetches through a machine that toggles their value: a zero becomes one and a one becomes zero.

Practice › Codeforces Solutions › Algorithms Thread Treaps Contest ›

CF 102787E - Sneetches and Speeches 2

The problem maintains a line of sneetches, where every sneetch has either 0 or 1 star. A query can either invert every value in a segment, changing 0 to 1 and 1 to 0, or reverse the order of a segment.

Practice › Codeforces Solutions › Algorithms Thread Treaps Contest ›

CF 102787D - The Grim Treaper

Part 2 will contain: The full executable implementation, with explanation of each code section. I’ll continue with Part 1 in the next message.

Practice › Codeforces Solutions › Algorithms Thread Treaps Contest ›

CF 102787B - Pear TreaP

We maintain a mutable string. The string starts with n lowercase letters, and then q operations modify it or ask questions about it. A deletion removes a whole contiguous interval.