Cf 362div2 C [map暴力，思维能力]

题目连接

http://codeforces.com/contest/697/problem/C

Description

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.

Sample 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

Sample Output

94
0
32

题意

给出二叉树上从一个点到另外一个点上经过每个点的权值，询问从某个点到另外一个点的总的权值是多少。

题解

开始以为要用最近公共祖先，写了老久错了，看别人代码发现不用LCA…直接map暴力。看了一个毛子的代码，发现好巧妙，自己思维能力真是不行。u，v都是比较取大值，然后从大值向小值跑，巧就巧在，他没有用任何特判什么的，直接就是
while(v!=u)
{
if(v<u)swap(u,v);
s[v]+=m;
v/=2;
}
天啊，太厉害了！
最近公共祖先：算出根到子树的路径，存入一个向量中，然后比较两个路径，首次出现不同的路径结束，前一个位置即为最近公共祖先。

代码

#include<bits/stdc++.h>
using namespace std;

int main()
{
    int n;
    scanf("%d",&n);
    long long t,v,u,m;
    map<long long,long long>s;
    for(int i=0;i<n;i++)
    {
        scanf("%I64d",&t);
        if(t==1)
        {
            scanf("%I64d%I64d%I64d",&v,&u,&m);
            while(v!=u)
            {
              if(v<u)swap(u,v);
              s[v]+=m;
              v/=2;
            }
        }
        else
        {   long long ans=0;
            scanf("%I64d%I64d",&v,&u);
            while(v!=u)
            {
                if(v<u)swap(u,v);
                ans+=s[v];
                v/=2;
            }
            printf("%I64d\n",ans);
        }
    }
    return 0;
}