OpenKattis
01. CS2040C Trial PS0

#### Start

2019-01-07 15:00 AKST

## 01. CS2040C Trial PS0

#### End

2019-01-22 14:59 AKST
The end is near!
Contest is over.
Not yet started.
Contest is starting in -585 days 8:14:10

359:59:59

0:00:00

# Problem FRelocation

Photo by Cory Doctorow

In the faraway country of Lineland, tech companies are starting to take over! Every week, it seems that tech companies sprout from the ground, merge, get acquired, or go under. For software engineers looking for new jobs in Lineland, it can be difficult to even find the companies where they’re interviewing.

To solve this issue, you’re going to make a new tech company! The product is simple: using deep neural blockchains in the cloud, your app finds the distance between any two tech companies in Lineland. This is supremely useful, as companies change offices all the time and it’s difficult to stay completely up to date. By centralizing this information, your company is going to make the world a better place.

Since Lineland is organized around a single line, the location of a company can be given by a single coordinate. The distance between any two companies is equal to the distance between their two coordinates.

Your job is to handle two kinds of user requests to the company’s flagship app. One kind of request updates the address of a company, the other requests the shortest distance between two companies.

## Input

The first line has two positive space-separated integers $N$ and $Q$: the number of companies the app tracks ($2 \le N \le 100\, 000$), and the number of requests to process ($1 \le Q \le 100\, 000$). The next line has $N$ space-separated integers $1 \le X_ i \le 10^9$, which are the initial locations of the $N$ companies, given in order from $i=1$ to $i=N$.

Each of the next $Q$ lines has $3$ space-separated integers, taking one of the following forms:

• $1~ C~ X$, which means that company $C$ moves its location to $X$, or

• $2~ A~ B$, which is a query for the distance between companies $A$ and $B$.

It is guaranteed that $1 \leq A, B, C \leq N$ and $1 \leq X \leq 10^9$. It is possible two companies can share the same location. It is also guaranteed there is at least one query of type $2$.

## Output

For each query of type $2$, print the distance between companies $A$ and $B$.

## Sample Explanation

In the first query, Company $2$ moves to location $10$. Then the app is asked for the distance between company $4$ and company $5$, which is $3$. The next query is the distance between companies $1$ and $3$, which is also $3$. A number of updates and queries follow.

Sample Input 1 Sample Output 1
5 10
5 2 8 1 4
1 2 10
2 4 5
2 1 3
1 4 3
2 1 5
2 5 2
1 4 1
2 2 4
1 3 15
2 4 1
3
3
1
6
9
4