Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Description

A and B are preparing themselves for programming contests.

The University where A and B study is a set of rooms connected by corridors. Overall, the University has n rooms connected by n - 1corridors so that you can get from any room to any other one by moving along the corridors. The rooms are numbered from 1 to n.

Every day А and B write contests in some rooms of their university, and after each contest they gather together in the same room and discuss problems. A and B want the distance from the rooms where problems are discussed to the rooms where contests are written to be equal. The distance between two rooms is the number of edges on the shortest path between them.

As they write contests in new rooms every day, they asked you to help them find the number of possible rooms to discuss problems for each of the following m days.

Input

The first line contains integer n (1 ≤ n ≤ 105) — the number of rooms in the University.

The next n - 1 lines describe the corridors. The i-th of these lines (1 ≤ i ≤ n - 1) contains two integers ai and bi (1 ≤ ai, bi ≤ n), showing that the i-th corridor connects rooms ai and bi.

The next line contains integer m (1 ≤ m ≤ 105) — the number of queries.

Next m lines describe the queries. The j-th of these lines (1 ≤ j ≤ m) contains two integers xj and yj (1 ≤ xj, yj ≤ n) that means that on the j-th day A will write the contest in the room xj, B will write in the room yj.

Output

In the i-th (1 ≤ i ≤ m) line print the number of rooms that are equidistant from the rooms where A and B write contest on the i-th day.

Sample Input

Input
41 21 32 412 3
Output
1
Input
41 22 32 421 21 3
Output
02

Hint

in the first sample there is only one room at the same distance from rooms number 2 and 3 — room number 1.

思路:

题意:给你一棵有n个节点的树,m个询问,每个询问a,b,求树中到a,b距离相等的节点个数

我们先使得deg[a] >= deg[b]

首先,若a~b之间的距离为奇数的话,找不到唯一的中点,此时答案为0

(怎么求a~b之间的距离呢?预处理节点i到根的距离(此处为深度)deg[i],求出lcaq = lca(a,b);

那么dist(a,b) = deg[a] - deg[lcaq] + deg[b] - deg[lcaq];)

否则:找出ab路径的中点mid,calc(u, d)可以找出节点u的深度为d的祖先,也就是我们求出中点的深度就可以找出中点!

怎么求中点的深度dmid?通过画图可知:

dmid = dist(a,b) / 2  - deg[b] + 2 * deg[lcaq];

最终答案的计算:num[i]表示以节点i为根的子树的节点总数

若a和b的深度相同,那么ans = num[lcaq] - num[xa] - num[xb]; 其中xa是lcaq在a~lcaq的下一个节点,xb是lcaq在b~lcaq的下一个节点

若a和b深度不同,那么ans = num[mid] - num[k], 其中k表示ab的中点的下一位置(在a和b路径上靠近a的下一位置),画图可以理解。

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

const int N = 1e5 + 5;
struct edge {
    int v, to;
    edge() {};
    edge(int v, int to) : v(v), to(to) {};
}e[N << 1];
int head[N], num[N], deg[N], tot, n, m;
int p[N][30];

void init()
{
    memset(head, -1, sizeof head);
    memset(p, -1, sizeof p);
    tot = 0;
}
void addedge(int u, int v)
{
    e[tot] = edge(v, head[u]);
    head[u] = tot++;
}
void dfs(int u, int fa, int d)
{
    deg[u] = d; p[u][0] = fa; num[u] = 1;
    for(int i = head[u]; ~i; i = e[i].to) {
        int v = e[i].v;
        if(v != fa) {
            dfs(v, u, d + 1);
            num[u] += num[v];
        }
    }
}
void pre()
{
    for(int j = 0; (1 << j) <= n; ++j)
        for(int i = 1; i <= n; ++i) {
            if(p[i][j - 1] != -1)
            p[i][j] = p[ p[i][j - 1] ][j - 1];
    }
}

int calc(int u, int d) ///返回节点u的深度为d的祖先
{
    for(int j = 25; j >= 0; --j) {
        if(deg[u] - (1 << j) >= d) u = p[u][j];
    }
    return u;
}
int lca(int a, int b)
{
    a = calc(a, deg[b]);///使a和b处在同一层
    if(a == b) return a; ///若此时a和b相等,那么lca就是a
    ///否则a和b同时向上爬
    for(int j = 25; j >= 0; --j) {
        if(p[a][j] != -1 && p[a][j] != p[b][j]) {
            a = p[a][j];
            b = p[b][j];
        }
    }
    return p[a][0];
}
int main()
{
    while(~scanf("%d", &n))
    {
        init();
        int u, v;
        for(int i = 1; i < n; ++i) {
            scanf("%d%d", &u, &v);
            addedge(u, v);
            addedge(v, u);
        }
        dfs(1, -1, 0);
        pre();

        scanf("%d", &m);
        int a, b;
        while(m --)
        {
            scanf("%d%d", &a, &b);
            if(deg[a] < deg[b]) swap(a, b);
            if(a == b) { printf("%d\n", n); continue; }
            int lcaq = lca(a, b);
            int dist = deg[a] + deg[b] - 2 * deg[lcaq]; ///a和b之间的距离
            if(dist & 1) { puts("0"); continue; }
            if(deg[a] == deg[b]) { ///xa和xb分别是在a~lca和b~lca的路径上距离lca为1的点
                int xa = calc(a, deg[lcaq] + 1);
                int xb = calc(b, deg[lcaq] + 1);
                printf("%d\n", n - num[xa] - num[xb]);
            }
            else {
                int mid = dist / 2 - deg[b] + 2 * deg[lcaq]; ///mid为ab之间的路径的中点的深度
                printf("%d\n", num[ calc(a, mid) ] - num[ calc(a, mid + 1) ]);
            }
        }
    }
    return 0;
}

  

codeforces 519E A and B and Lecture Rooms LCA倍增的更多相关文章

  1. codeforces 519E A and B and Lecture Rooms(LCA,倍增)

    转载请注明出处: http://www.cnblogs.com/fraud/          ——by fraud E. A and B and Lecture Rooms A and B are ...

  2. Codeforces 519E A and B and Lecture Rooms

    http://codeforces.com/contest/519/problem/E 题意: 给出一棵树和m次询问,每次询问给出两个点,求出到这两个点距离相等的点的个数. 思路: lca...然后直 ...

  3. CodeForces 519E A and B and Lecture Rooms(倍增)

    A and B are preparing themselves for programming contests. The University where A and B study is a s ...

  4. Codeforces 519E A and B and Lecture Rooms [倍增法LCA]

    题意: 给你一棵有n个节点的树,给你m次询问,查询给两个点,问树上有多少个点到这两个点的距离是相等的.树上所有边的边权是1. 思路: 很容易想到通过记录dep和找到lca来找到两个点之间的距离,然后分 ...

  5. [codeforces 519E]E. A and B and Lecture Rooms(树上倍增)

    题目:http://codeforces.com/problemset/problem/519/E 题意:给你一个n个点的树,有m个询问(x,y),对于每个询问回答树上有多少个点和x,y点的距离相等 ...

  6. Codeforces Round #294 (Div. 2) A and B and Lecture Rooms(LCA 倍增)

    A and B and Lecture Rooms time limit per test 2 seconds memory limit per test 256 megabytes input st ...

  7. [CF Round #294 div2] E. A and B and Lecture Rooms 【树上倍增】

    题目链接:E. A and B and Lecture Rooms 题目大意 给定一颗节点数10^5的树,有10^5个询问,每次询问树上到xi, yi这两个点距离相等的点有多少个. 题目分析 若 x= ...

  8. Codeforces 519 E. A and B and Lecture Rooms

    Description 询问一个树上与两点距离相等的点的个数. Sol 倍增求LCA. 一棵树上距离两点相等,要么就只有两点的中点,要么就是与中点相连的所有点. 有些结论很容易证明,如果距离是偶数,那 ...

  9. Codeforces Round #287 D.The Maths Lecture

    The Maths Lecture 题意:求存在后缀Si mod k =0,的n位数的数目.(n <=1000,k<=100); 用f[i][j]代表 长为i位,模k等于j的数的个数. 可 ...

随机推荐

  1. 【转】c#、wpf 字符串,color,brush之间的转换

    转自:http://www.cnblogs.com/wj-love/archive/2012/09/14/2685281.html 1,将#3C3C3C 赋给background this.selec ...

  2. Centos 6.5 rsync+inotify 两台服务器文件实时同步

    rsync和inotify是什么我这里就不在介绍了,有专门的文章介绍这两个工具. 1.两台服务器IP地址分别为: 源服务器:192.168.1.2 目标服务器:192.168.1.3 @todo:从源 ...

  3. text-indent

    <div class="top wd"> <div class="con fl "><a href="#"&g ...

  4. 使用 CodeIgniter 框架快速开发 PHP 应用(七)

    原文:使用 CodeIgniter 框架快速开发 PHP 应用(七) CodeIgniter 和对象这是玩家章节.它讲述的是 CodeIgniter 的工作原理,也就是揭开CI头上'神秘的面纱'.如果 ...

  5. 51nod 修改数组

    修改数组 给出一个整数数组A,你可以将任何一个数修改为任意一个正整数,最终使得整个数组是严格递增的且均为正整数.问最少需要修改几个数? Input 第1行:一个数N表示序列的长度(1 <= N  ...

  6. Xcode的SVN提示&quot;The request timed out.&quot;的解决方案

    问题描述 在利用Xcode的SourceControl进行SVN代码检出时,确认输入地址.帐号密码都正确的情况下,总是提示"The request timed out.".该问题的 ...

  7. HBase Block Cache(块缓存)

    Block Cache HBase提供了两种不同的BlockCache实现,用于缓存从HDFS读出的数据.这两种分别为: 默认的,存在于堆内存的(on-heap)LruBlockCache 存在堆外内 ...

  8. Dev GridControl数据修改后实时更新数据源(转)

    1:  /// <summary> 2:  /// 嵌入的ComboxEdit控件选择值变化事件 3:  /// </summary> 4: /// <param nam ...

  9. 利用css实现带有省略号的段落

    带有省略号的段落就是你只能在一行显示一段文字,文字过长是肯定不能完全显示的,如果默认的话,超出的文字会自动换行,撑大盒子. 1.这时需要设置white-space: nowrap,禁止换行.这样的话, ...

  10. express安装中出现无此命令

    原来,最新express4.0版本中将命令工具分家出来了(项目地址:https://github.com/expressjs/generator),所以我们还需要安装一个命令工具,命令如下: 安装ex ...