【洛谷P3806 【模板】点分治1】点分治

最新推荐文章于 2024-04-27 15:51:03 发布

原创最新推荐文章于 2024-04-27 15:51:03 发布 · 211 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

ACM 同时被 2 个专栏收录

455 篇文章

订阅专栏

点分治

11 篇文章

订阅专栏

这篇博客详细介绍了如何解决洛谷P3806问题，该问题涉及树上的点对距离查询。博客作者讨论了点分治的思想，指出其本质上是树分治，通过选取特定点将树划分为层次，并对各子树进行操作以统计答案。尽管作者去年曾接触点分治，但并未深入理解，因此决定重新学习并完善题解，以期望能彻底掌握点分治的精髓。

P3806
题目描述
给定一棵有n个点的树

询问树上距离为k的点对是否存在。

输入格式
n,m 接下来n-1条边a,b,c描述a到b有一条长度为c的路径

接下来m行每行询问一个K

输出格式
对于每个K每行输出一个答案，存在输出“AYE”,否则输出”NAY”(不包含引号)

其实点分治去年学过但是去年只学了个皮毛
所以这次又重新写一篇题解
尽可能写的详细

首先我们要清楚点分治的本质在我看来点分治通常是在树上操作虽然名字叫做点分治但是本质在我看来是树分治你可以通过找到一个点来把树划分层次通过对不同子树的操作来统计答案
网上对于点分治的讲解还蛮多的希望这次自己能理解通彻点分治

UPD:算了点分治过一会在补个学习笔记吧这次学通彻了再补

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);

/*namespace sgt
{
    #define mid ((l+r)>>1)

    #undef mid
}*/
const int MAX_N = 20025;
int p[MAX_N],eid,ask[MAX_N],ans[MAX_N],dis[MAX_N],T,TT,Size[MAX_N],maxson[MAX_N],SIZE,ms,root,m;
bool vis[MAX_N];
void init()
{
    memset(p,-1,sizeof(p));
    eid = 0;
}
struct edge
{
    int v,next,len;
}e[MAX_N];
void add(int u,int v,int len)
{
    e[eid].v = v;
    e[eid].len = len;
    e[eid].next = p[u];
    p[u] = eid++;
}
void getroot(int x,int fa)//求重心
{
    Size[x] = 1;maxson[x] = 0;
    for(int i = p[x];i!=-1;i=e[i].next)
    {
        int v = e[i].v;
        if(vis[v]||v==fa) continue;
        getroot(v,x);
        Size[x] += Size[v];
        if(Size[v]>maxson[x]) maxson[x] = Size[v];
    }
    if(SIZE-Size[x]>maxson[x]) maxson[x] = SIZE - Size[x];
    if(ms>maxson[x]) ms = maxson[x],root = x;
}
void getdis(int x,int fa,int z)
{
    dis[++T] = z;
    for(int i = p[x];i!=-1;i=e[i].next)
    {
        int v = e[i].v;
        if(v==fa||vis[v]) continue;
        getdis(v,x,z+e[i].len);
    }
}
struct node{int x,y;}arr[MAX_N];
bool cmp(int x,int y) {return x < y;};
void solve(int x,int y,int id)
{
    T = 0;
    getdis(x,0,y);
    TT = 0;
    sort(dis+1,dis+1+T,cmp);
    dis[0] = -233;
    for(int i = 1;i<=T;++i)
        if(dis[i]!=dis[i-1]) arr[++TT].x = dis[i],arr[TT].y = 1;
        else arr[TT].y++;
    for(int i = 1;i<=m;++i)
    {
        if(ask[i]%2==0)
        for(int j = 1;j<=TT;j++)
            if(arr[j].x==ask[i]/2) ans[i]+=(arr[j].y-1)*arr[j].y/2*id;
        for(int j = 1;j<=TT&&arr[j].x<ask[i]/2;j++)
        {
            int l = j+1,r = TT;
            while(l<=r)
            {
                int mid = (l+r)>>1;
                if(arr[mid].x+arr[j].x==ask[i])
                {
                    ans[i]+=arr[j].y*arr[mid].y*id;
                    break;
                }
                if(arr[j].x+arr[mid].x<=ask[i]) l = mid + 1;
                else r = mid - 1;
            }
        }
    }
}
void fenzhi(int x,int ssize)//ssize是当前这棵子树的大小
{
    vis[x] = true;
    solve(x,0,1);
    for(int i = p[x];i+1;i=e[i].next)
    {
        int v = e[i].v;
        if(vis[v]) continue;
        solve(v,e[i].len,-1);//减去不合法
        ms = inf,root = 0;//记得初始化
        SIZE = Size[v]<Size[x]?Size[v]:(ssize-Size[x]);
        getroot(v,0);//求以y为根的字数
        fenzhi(root,(Size[v]<Size[x]?Size[v]:(ssize-Size[x])));
    }
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,x,y,z;
    scanf("%d%d",&n,&m);
    init();
    for(int i = 1;i<n;++i)
    {
        scanf("%d%d%d",&x,&y,&z);
        add(x,y,z);
        add(y,x,z);
    }
    for(int i = 1;i<=m;++i)
        scanf("%d",&ask[i]);
    root = 0;ms = inf;SIZE = n;
    getroot(1,0);
    fenzhi(root,n);
    for(int i = 1;i<=m;++i) if(ans[i]>0) printf("AYE\n");
    else printf("NAY\n");
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}