C. Lorenzo Von Matterhorn LCA

C. Lorenzo Von Matterhorn

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 2v 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.

Example

input

Copy

7
1 3 4 30
1 4 1 2
1 3 6 8
2 4 3
1 6 1 40
2 3 7
2 2 4

output

Copy

94
0
32

Note

In the example testcase:

Here are the intersections used:

1. Intersections on the path are 3, 1, 2 and 4.
2. Intersections on the path are 4, 2 and 1.
3. Intersections on the path are only 3 and 6.
4. Intersections on the path are 4, 2, 1 and 3. Passing fee of roads on the path are 32, 32 and 30 in order. So answer equals to 32 + 32 + 30 = 94.
5. Intersections on the path are 6, 3 and 1.
6. Intersections on the path are 3 and 7. Passing fee of the road between them is 0.
7. Intersections on the path are 2 and 4. Passing fee of the road between them is 32 (increased by 30 in the first event and by 2 in the second).

LCA
这个题目是用一种LCA的思想，就是对于1的数找到他们的公共祖先，然后存起来（用二进制去存）
如果你碰到查询也就是2，那就先找到他们的公共祖先，然后和之前存起来的路径去求这个花费的最少的钱数。

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
const int maxn = 1e4 + 100;
struct node
{
	ll u, v, val;
	ll f;
	node(ll u=0,ll v=0,ll val=0,ll f=0):u(u),v(v),val(val),f(f){}
}exa[maxn];
ll findx(ll u,ll v)
{
	while(u!=v)
	{
		if (u < v) v >>= 1;
		else u >>= 1;
	}
	return u;
}

ll solve1(ll u,ll v,ll mi,ll val)
{
	ll tot = 0;
	ll f = findx(u, v);
	if (f <= mi) return 0;
	while(f!=mi)
	{
		f >>= 1;
		tot++;
	}
	return tot * val;
}

ll solve(node a,node b)
{
	ll ans = 0;
	ll mi = max(a.f, b.f);
	ans += solve1(a.u, b.u, mi, b.val);
	ans += solve1(a.u, b.v, mi, b.val);
	ans += solve1(a.v, b.v, mi, b.val);
	ans += solve1(a.v, b.u, mi, b.val);
	return ans;
}

int main()
{
	int n,cnt=0;
	cin >> n;
	int type;
	ll u, v, val;
	while(n--)
	{
		cin >> type;
		if (type == 1)
		{
			cin >> u >> v >> val;
			ll f = findx(u, v);
			exa[cnt++] = node(u, v, val,f);
		}
		else
		{
			ll ans = 0;
			node temp;
			cin >> temp.u >> temp.v;
			temp.f = findx(temp.u, temp.v);
			for(int i=0;i<cnt;i++)
			{
				ans += solve(temp, exa[i]);
			}
			printf("%lld\n", ans);
		}
	}
	return 0;
}