|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|2 초||256 MB||0||0||0||0.000%|
Rikka has an interval tree with $(n-1)$ internal nodes and $n$ leaves. Each node is associated with some non-empty interval of integers. The root is associated with the interval $[1, n]$. For any internal node associated with $[l, r]$, there exists an integer $m$ such that its left child is associated with $[l, m]$ and the right child is associated with $[m+1, r]$.
Initially, all nodes are white. Rikka can perform some queries on intervals. When she performs a query on the interval $[A, B]$, for each node $u$ satisfying the following conditions, the path from the root to node $u$, inclusive, is colored black. The conditions are:
You are given the resulting colors of all the nodes. What is the minimum number of queries Rikka has to perform so that all the nodes have the given colors?
The first line contains an integer $n$ ($1 \leq n \leq 4000$).
Each of the following $(2n - 1)$ lines describes the nodes of the interval tree, one per line. The nodes are described in prefix order: the first node described is the root, and for every internal node, its description is immediately followed by the description of its left subtree, which is then immediately followed by the description of its right subtree.
For an internal node, the line contains two integers $t_i$ and $m_i$. For a leaf, the line contains one integer $t_i$.
A node is black if $t_i = 1$ and it is white if $t_i = 0$. It is guaranteed that each $t_i$ is either $0$ or $1$.
For an internal node associated with $[l, r]$, its left child is associated with $[l, m_i]$, and its right child is associated with $[m_i + 1, r]$. It is guaranteed that the input describes a valid interval tree. In particular, if node $i$ is an internal node associated with $[l, r]$, then the value $m_i$ is such that $l \leq m_i < r$.
Print one integer: the minimum possible number of queries after which all nodes will have the given colors. If it is impossible to color the nodes as requested, output the string "
2 1 1 1 1
2 0 1 1 1
9 1 5 1 3 1 2 1 1 0 1 1 1 4 0 0 1 7 1 6 1 0 1 8 1 0