题目描述

F. MEX Queries
[2300]

F. MEX Queries
time limit per test2 seconds
memory limit per test256 megabytes

You are given a set of integer numbers, initially it is empty. You should perform n queries.

There are three different types of queries:

  • 1 l r — Add all missing numbers from the interval [l, r]
  • 2 l r — Remove all present numbers from the interval [l, r]
  • 3 l r — Invert the interval [l, r] — add all missing and remove all present numbers from the interval [l, r]
    After each query you should output MEX of the set — the smallest positive (MEX  ≥ 1) integer number which is not presented in the set.

Input
The first line contains one integer number n (1 ≤ n ≤ 105).

Next n lines contain three integer numbers t, l, r (1 ≤ t ≤ 3, 1 ≤ l ≤ r ≤ 1018) — type of the query, left and right bounds.

Output
Print MEX of the set after each query.

Examples

1
2
3
4
5
6
7
8
9
Input
3
1 3 4
3 1 6
2 1 3
Output
1
3
1
1
2
3
4
5
6
7
8
9
10
11
Input
4
1 1 3
3 5 6
2 4 4
3 1 6
Output
4
4
4
1

Note
Here are contents of the set after each query in the first example:

{3, 4} — the interval [3, 4] is added
{1, 2, 5, 6} — numbers {3, 4} from the interval [1, 6] got deleted and all the others are added
{5, 6} — numbers {1, 2} got deleted

思路

segment tree

代码

1