codeforces #362（Div.2）C.Lorenzo Von Matterhorn【最近公祖先相关】

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 2 vu 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

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

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 to32 + 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).

题目大意：

给你Q个操作，对应操作:

1 u v w 表示从u到v的树上最短路径上的每一条无向边的权值都加上w

2 u v 表示查询从u到v的树上最短路径上的每一条无向边的权值加和

思路：

这是一个不需要Tarjan---LCA算法的一道最近公共祖先的问题。

1、看到10^18的点的数量，就表想建边建点构图的问题了。

2、这是一颗二叉树.所以两点间的树上最短路径所经过的每一条边都是固定的，其实就是在说，找这两个点的最近公共祖先，然后分别从这两个点到其公共祖先的距离和就是两点间的树上最短路径。

3、那么根据上述的特点，我们完全可以保存每一条边上的权值，并且维护加和，那么我们用什么来保存其值呢？map映射可以解决这个问题，我们用任何数组都做不到的事情，map映射就能够解决。s【点u】=x表示从u出发到其祖先（u/2）的权值和，那么我们在输入的时候，维护这个map映射值即可。

4、在操作1的时候，因为是二叉树，所以其寻找最近公共祖先就用两个点的编号大的编号除以2，一直除到两个点编号变成一样的，那么这个一样的编号就是其公共祖先，维护权值到这里，停止跳出。在操作2的时候，跟操作1一样，只不过操作1是维护权值和，操作2用来累加这个和。

Ac代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<map>
using namespace std;
#define ll long long int
struct node
{
    ll u,v,w;
}a[1000000];
int main()
{
    int q;
    map<ll ,ll >h;
    scanf("%d",&q);
    int cont=0;
    while(q--)
    {
        ll ans=0;
        int op;
        scanf("%d",&op);
        if(op==1)
        {
            ll u,v,w;
            scanf("%I64d%I64d%I64d",&u,&v,&w);
            while(u!=v)
            {
                if(u>v)
                {
                    h[u]+=w;
                    u/=2;
                }
                else
                {
                    h[v]+=w;
                    v/=2;
                }
            }
        }
        if(op==2)
        {
            ans=0;
            ll u,v;
            scanf("%I64d%I64d",&u,&v);
            ll ans=0;
            while(u!=v)
            {
                if(u>v)
                {
                    ans+=h[u];
                    u/=2;
                }
                else
                {
                    ans+=h[v];
                    v/=2;
                }
            }
            printf("%I64d\n",ans);
        }
    }
}