Codeforces Round #362 (Div. 2)C. Lorenzo Von Matterhorn 二叉树结点规律

题目链接

题目描述：
C. Lorenzo Von Matterhorn
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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 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.

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:

Intersections on the path are 3, 1, 2 and 4.
Intersections on the path are 4, 2 and 1.
Intersections on the path are only 3 and 6.
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.
Intersections on the path are 6, 3 and 1.
Intersections on the path are 3 and 7. Passing fee of the road between them is 0.
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).

题意：
在一个完全二叉树中，求从一个节点到另一个节点需要走过的距离，初始为0，输入有两种命令：输入为1时对u到v进行更新，将u到v的路径的距离都加v，输入为2时求u到v的距离。

题解：
按照二叉树的结点规律进行计算即可，注意给出的数据范围比较大，用map读入的结点数据即可.

ac代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;
map<ll,ll> cnt;
int main()
{
    //freopen("in.txt","r",stdin);
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        int p;
        scanf("%d",&p);
        if(p==1)
        {
            ll from,to,v;
            scanf("%I64d%I64d%I64d",&from,&to,&v);
            ll s=max(from,to),e=min(from,to);
            while(s!=e)
            {
                if(s>e){
                    cnt[s]+=v;
                    s/=2;
                }
                else{
                    cnt[e]+=v;
                    e/=2;
                }
            }
        }
        else if(p==2)
        {
            ll from,to;
            scanf("%I64d%I64d",&from,&to);
            ll s=max(from,to),e=min(from,to);
            ll ans=0;
            while(s!=e)
            {
                if(s>e){
                    ans+=cnt[s];
                    s/=2;
                }
                else{
                    ans+=cnt[e];
                    e/=2;
                }
            }
            printf("%I64d\n",ans);
        }
    }

}