Problem:
Treap

A binary search tree can be unbalanced depending on features of data. For example, if we insert $n$ elements into a binary search tree in ascending order, the tree become a list, leading to long search times. One of strategies is to randomly shuffle the elements to be inserted. However, we should consider to maintain the balanced binary tree where different operations can be performed one by one depending on requirement.

We can maintain the balanced binary search tree by assigning a priority randomly selected to each node and by ordering nodes based on the following properties. Here, we assume that all priorities are distinct and also that all keys are distinct.

binary-search-tree property. If $v$ is a left child of $u$, then $v.key < u.key$ and if $v$ is a right child of $u$, then $u.key < v.key$

heap property. If $v$ is a child of $u$, then $v.priority < u.priority$

This combination of properties is why the tree is called Treap (tree + heap).

An example of Treap is shown in the following figure.

Insert

To insert a new element into a Treap, first of all, insert a node which a randomly selected priority value is assigned in the same way for ordinal binary search tree. For example, the following figure shows the Treap after a node with key = 6 and priority = 90 is inserted.

It is clear that this Treap violates the heap property, so we need to modify the structure of the tree by rotate operations. The rotate operation is to change parent-child relation while maintaing the binary-search-tree property.

The rotate operations can be implemented as follows.

rightRotate(Node t)
Node s = t.left
t.left = s.right
s.right = t
return s // the new root of subtree

leftRotate(Node t)
Node s = t.right
t.right = s.left
s.left = t
return s // the new root of subtree

The following figure shows processes of the rotate operations after the insert operation to maintain the properties.

The insert operation with rotate operations can be implemented as follows.

insert(Node t, int key, int priority) // search the corresponding place recursively
if t == NIL
return Node(key, priority) // create a new node when you reach a leaf
if key == t.key
return t // ignore duplicated keys

if key < t.key // move to the left child
t.left = insert(t.left, key, priority) // update the pointer to the left child
if t.priority < t.left.priority // rotate right if the left child has higher priority
t = rightRotate(t)
else // move to the right child
t.right = insert(t.right, key, priority) // update the pointer to the right child
if t.priority < t.right.priority // rotate left if the right child has higher priority
t = leftRotate(t)

return t

Delete

To delete a node from the Treap, first of all, the target node should be moved until it becomes a leaf by rotate operations. Then, you can remove the node (the leaf). These processes can be implemented as follows.

delete(Node t, int key) // seach the target recursively
if t == NIL
return NIL
if key < t.key // search the target recursively
t.left = delete(t.left, key)
else if key > t.key
t.right = delete(t.right, key)
else
return _delete(t, key)
return t

_delete(Node t, int key) // if t is the target node
if t.left == NIL && t.right == NIL // if t is a leaf
return NIL
else if t.left == NIL // if t has only the right child, then perform left rotate
t = leftRotate(t)
else if t.right == NIL // if t has only the left child, then perform right rotate
t = rightRotate(t)
else // if t has both the left and right child
if t.left.priority > t.right.priority // pull up the child with higher priority
t = rightRotate(t)
else
t = leftRotate(t)
return delete(t, key)

Write a program which performs the following operations to a Treap $T$ based on the above described algorithm.

insert ($k$, $p$): Insert a node containing $k$ as key and $p$ as priority to $T$.

find ($k$): Report whether $T$ has a node containing $k$.

delete ($k$): Delete a node containing $k$.

print(): Print the keys of the binary search tree by inorder tree walk and preorder tree walk respectively.

Input

In the first line, the number of operations $m$ is given. In the following $m$ lines, operations represented by insert $k \; p$, find $k$, delete $k$ or print are given.

Output

For each find($k$) operation, print "yes" if $T$ has a node containing $k$, "no" if not.

In addition, for each print operation, print a list of keys obtained by inorder tree walk and preorder tree walk in a line respectively. Put a space character before each key.

Constraints

The number of operations $ \leq 200,000$

$0 \leq k, p \leq 2,000,000,000$

The height of the binary tree does not exceed 50 if you employ the above algorithm

The keys in the binary search tree are all different.

The priorities in the binary search tree are all different.

The size of output $\leq 10$ MB

Sample Input 1

16
insert 35 99
insert 3 80
insert 1 53
insert 14 25
insert 80 76
insert 42 3
insert 86 47
insert 21 12
insert 7 10
insert 6 90
print
find 21
find 22
delete 35
delete 99
print

Sample Output 1

1 3 6 7 14 21 35 42 80 86
35 6 3 1 14 7 21 80 42 86
yes
no
1 3 6 7 14 21 42 80 86
6 3 1 80 14 7 21 42 86

Reference

Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.

Randomized Search Trees, R. Seidel, C.R. Aragon.

Solution in Rust (judge verdict: Accepted)

use std::fmt;
use std::io::stdin;
use std::io::BufRead;
use std::str;
use std::str::FromStr;
#[derive(Debug)]
pub struct Node {
	pub key:u32,
	pub priority:u64,
	pub left:Box<Option<Node>>,
	pub right:Box<Option<Node>>,
}
impl Node {
	pub fn new(key:u32,priority:u64) -> Node {
		Node {
			priority:priority,
			key:key,
			left:Box::new(None),
			right:Box::new(None),
		}
	}

	pub fn right_rotate(t:Node) -> Node {
		match *t.left {
			Some(left) => {
				Node {
					priority: left.priority,
					key: left.key,
					left: left.left,
					right: Box::new(Some(Node {
						key: t.key,
						priority: t.priority,
						left: left.right,
						right: t.right,
					}))
				}
			},
			None => t
		}
	}

	pub fn left_rotate(t:Node) -> Node {
		match *t.right {
			Some(right) => {
				Node {
					priority: right.priority,
					key: right.key,
					right: right.right,
					left: Box::new(Some(Node {
						key: t.key,
						priority: t.priority,
						right: right.left,
						left: t.left,
					}))
				}
			},
			None => t
		}
	}

	pub fn insert(t:Box<Option<Node>>, key:u32, priority:u64) -> Node {
		match *t {
			None => Node::new(key,priority),
			Some(t) => {
				if key == t.key {
					t
				} else if key < t.key {
					let left = Node::insert(t.left, key, priority);

					if t.priority < left.priority {
						Node::right_rotate(Node {
							key: t.key,
							priority: t.priority,
							left: Box::new(Some(left)),
							right: t.right
						})
					} else {
						Node {
							key: t.key,
							priority: t.priority,
							left: Box::new(Some(left)),
							right: t.right
						}
					}
				} else {
					let right = Node::insert(t.right, key, priority);

					if t.priority < right.priority {
						Node::left_rotate(Node {
							key: t.key,
							priority: t.priority,
							left: t.left,
							right: Box::new(Some(right))
						})
					} else {
						Node {
							key: t.key,
							priority: t.priority,
							left: t.left,
							right: Box::new(Some(right))
						}
					}
				}
			}
		}
	}

	fn delete_at(t:Box<Option<Node>>,key:u32) -> Option<Node> {
		Node::delete(Box::new(match *t {
			None => None,
			Some(t) => {
				if t.left.is_none() && t.right.is_none() {
					return None;
				} else if t.left.is_none() {
					Some(Node::left_rotate(t))
				} else if t.right.is_none() {
					Some(Node::right_rotate(t))
				} else {
					let lp = match *t.left {
						None => 0,
						Some(ref n) => n.priority,
					};

					let rp = match *t.right {
						None => 0,
						Some(ref n) => n.priority,
					};

					if lp > rp {
						Some(Node::right_rotate(t))
					} else {
						Some(Node::left_rotate(t))
					}
				}
			}
		}), key)
	}

	pub fn delete(t:Box<Option<Node>>,key:u32) -> Option<Node> {
		match *t {
			None => {
				return None;
			},
			Some(t) => {
				if key < t.key {
					Some(Node {
						priority:t.priority,
						key:t.key,
						left:Box::new(Node::delete(t.left,key)),
						right:t.right
					})
				} else if key > t.key {
					Some(Node {
						priority:t.priority,
						key:t.key,
						left:t.left,
						right:Box::new(Node::delete(t.right,key)),
					})
				} else {
					Node::delete_at(Box::new(Some(t)),key)
				}
			}
		}
	}

	pub fn find(root:&Node,key:u32) -> bool {
		let mut t = root;

		while key != t.key {
			if key < t.key {
				match *t.left {
					None => {
						return false;
					},
					Some(ref n) => {
						t = n;
					}
				}
			} else if key > t.key {
				match *t.right {
					None => {
						return false;
					},
					Some(ref n) => {
						t = n;
					}
				}
			}
		}

		true
	}

	pub fn print(root:&Node) {
		print!(" {}\n",Node::in_order(root).into_iter().map(|k| k.to_string()).collect::<Vec<String>>().join(" "));
		print!(" {}\n",Node::pre_order(root).into_iter().map(|k| k.to_string()).collect::<Vec<String>>().join(" "));
	}

	fn in_order(t:&Node) -> Vec<u32> {
		let mut keys:Vec<u32> = Vec::new();

		if let Some(ref l) = *t.left {
			keys.append(&mut Node::in_order(l));
		}

		keys.push(t.key);

		if let Some(ref r) = *t.right {
			keys.append(&mut Node::in_order(r));
		}

		keys
	}

	fn pre_order(t:&Node) -> Vec<u32> {
		let mut keys:Vec<u32> = Vec::new();

		keys.push(t.key);

		if let Some(ref l) = *t.left {
			keys.append(&mut Node::pre_order(l));
		}

		if let Some(ref r) = *t.right {
			keys.append(&mut Node::pre_order(r));
		}

		keys
	}
}
fn main() {
	let stdin = stdin();
	let mut reader = InputScanner::new(stdin.lock(),256);

	let m:usize = reader.next();
	let mut root:Box<Option<Node>> = Box::new(None);

	for _ in 0..m {
		let command:String = reader.next();

		match command.as_str() {
			"insert" => {
				root = Box::new(Some(Node::insert(root, reader.next(), reader.next())));
			},
			"find" => {
				if let Some(ref root) = *root {
					if Node::find(root,reader.next()) {
						print!("yes\n");
					} else {
						print!("no\n");
					}
				} else {
					panic!("invalid state.");
				}
			},
			"delete" => {
				root = Box::new(Node::delete(root,reader.next()));
			},
			"print" => {
				if let Some(ref root) = *root {
					Node::print(root);
				}
			},
			_ => {
				panic!("invalid command.");
			}
		}
	}
}
struct InputScanner<R: BufRead> {
	reader: R,
	buf: Vec<u8>, // Should never be empty
	pos: usize,   // Should never be out of bounds as long as the input ends with '\n'
}

impl<R: BufRead> InputScanner<R> {
	fn new(reader: R, capacity: usize) -> Self {
		InputScanner {
			reader: reader,
			buf: Vec::with_capacity(capacity),
			pos: 0,
		}
	}

	#[inline]
	fn next<T: FromStr>(&mut self) -> T
	where
		T::Err: fmt::Debug,
	{
		if self.buf.is_empty() {
			self._read_next_line();
		}
		let mut start = None;
		loop {
			match (self.buf[self.pos], start.is_some()) {
				(b' ', true) | (b'\n', true) | (b'\r', true) => break,
				(_, true) | (b' ', false) => self.pos += 1,
				(b'\n', false) | (b'\r', false) => self._read_next_line(),
				(_, false) => start = Some(self.pos),
			}
		}
		let target = &self.buf[start.unwrap()..self.pos];
		unsafe { str::from_utf8_unchecked(target) }.parse().unwrap()
	}

	#[inline]
	fn _read_next_line(&mut self) {
		self.pos = 0;
		self.buf.clear();
		if self.reader.read_until(b'\n', &mut self.buf).unwrap() == 0 {
			panic!("Reached EOF");
		}
	}
}