# 朴素LCA求解

/ 0评 / 0
##### codeforces #362（Div.2）C.Lorenzo Von Matterhorn

Barney lives in NYC. NYC has infinite number of intersections numbered with positive integers starting from 1. There exists a bidirectional road between intersections $i$ and $2i$ and another road between $i$ and $2i + 1$ for every positive integer $i$. You can clearly see that there exists a unique shortest path between any two intersections.

Initially anyone can pass any road for free. But since SlapsGiving is ahead of us, there will $q$ consecutive events happen soon. There are two types of events:
$1.$ Government makes a new rule. A rule can be denoted by integers $v, u$ and $w$. As the result of this action, the passing fee of all roads on the shortest path from $u$ to $v$ increases by $w$ dollars.
$2.$ Barney starts moving from some intersection v and goes to intersection u where there's a girl he wants to cuddle (using his fake name Lorenzo Von Matterhorn). He always uses the shortest path (visiting minimum number of intersections or roads) between two intersections.
Government needs your calculations. For each time Barney goes to cuddle a girl, you need to tell the government how much money he should pay (sum of passing fee of all roads he passes).

#### Input

The first line of input contains a single integer $q (1 ≤ q ≤ 1 000)$.
The next q lines contain the information about the events in chronological order. Each event is described in form $1 \ v \ u \ w$if it's an event when government makes a new rule about increasing the passing fee of all roads on the shortest path from $u$ to $v$ by $w$ dollars, or in form $2 \ v \ u$ if it's an event when Barnie goes to cuddle from the intersection $v$ to the intersection $u$.
$1 ≤ v, u ≤ 1018, v ≠ u, 1 ≤ w ≤ 109$states for every description line.

#### Output

For each event of second type print the sum of passing fee of all roads Barney passes in this event, in one line. Print the answers in chronological order of corresponding events.

#### 题解：

$q$ 个事件 $1.u \ v \ w$ 从$u$到$v$的费用增加$w$ ; $2.u \ v$从$u$到$v$的最短路(经过最少的边的数量)上的花费

• 默认
• 护眼
• 夜晚
• Serif
• Sans