Entrenamiento OIE Nivel Experto - Semana 12

5 problems from Entrenamiento OIE Nivel Experto - Semana 12 (contest 106431), difficulty -. 4/5 solutions verified against sample I/O.

5 items

Entrenamiento OIE Nivel Experto - Semana 12

Special | 5 problems | 4/5 verified | Difficulty - | 4m 28s

#	Problem	Time	✓
A	Parking	47s	✓
B	Bigint	36s	✓
C	Tao of Trees (search trees)	37s	✓
D	Tao of Trees (treaps)	35s	✓
E	Tao of Trees (more treaps)	1m 53s

Practice › Codeforces Solutions › Entrenamiento OIE Nivel Experto - Semana 12 ›

CF 106431E - Tao of Trees (more treaps)

I can write this editorial, but I need the actual problem statement and constraints for Codeforces 106431E - Tao of Trees (more treaps).

Practice › Codeforces Solutions › Entrenamiento OIE Nivel Experto - Semana 12 ›

CF 106431D - Tao of Trees (treaps)

The task is to maintain a binary search tree with treap rules. Each node has a key, which determines its position in the search tree, and a height value, which acts like a priority.

Practice › Codeforces Solutions › Entrenamiento OIE Nivel Experto - Semana 12 ›

CF 106431A - Parking

We are given a street represented as a single string. Each character describes one parking slot. A dash means the slot is free, while an X means it is already blocked and cannot be used. We are allowed to place vehicles only into consecutive free slots.

Practice › Codeforces Solutions › Entrenamiento OIE Nivel Experto - Semana 12 ›

CF 106431C - Tao of Trees (search trees)

The problem asks us to maintain a binary search tree while a sequence of commands is executed. The tree starts empty.

Practice › Codeforces Solutions › Entrenamiento OIE Nivel Experto - Semana 12 ›

CF 106431B - Bigint

The task is about performing arithmetic on integers that are too large to fit into the normal integer types available in most programming languages. The input contains two non negative integers written as decimal strings, and the output is their sum written in decimal form.