Infinite Inversions

2000ms

262144K

Description:

There is an infinite sequence consisting of all positive integers in the increasing order: p = {1, 2, 3, ...}. We performed n swap operations with this sequence. A swap(a, b) is an operation of swapping the elements of the sequence on positions a and b. Your task is to find the number of inversions in the resulting sequence, i.e. the number of such index pairs (i, j), that i < j and p_i > p_j.

Input:

The first line contains a single integer n (1 ≤ n ≤ 10⁵) — the number of swap operations applied to the sequence.

Each of the next n lines contains two integers a_i and b_i (1 ≤ a_i, b_i ≤ 10⁹, a_i ≠ b_i) — the arguments of the swap operation.

Output:

Print a single integer — the number of inversions in the resulting sequence.

Sample Input:

2
4 2
1 4

Sample Output:

Sample Input:

Sample Output:

Note:

In the first sample the sequence is being modified as follows: $\text{[math]}$ . It has 4 inversions formed by index pairs (1, 4), (2, 3), (2, 4) and (3, 4).

Informação

Provedor Codeforces

Código CF540E