题意:给定一棵有 n n n个点的树和 m m m个询问,每个询问要求回答树上距离为 k k k的点对是否存在。
n < = 1 0 4 , m < = 1 0 2 , w i < = 1 0 3 , k < = 1 0 7 n<=10^4,m<=10^2,w_i<=10^3,k<=10^7 n<=104,m<=102,wi<=103,k<=107
树上+距离+点对≈点分治(
一开始简单考虑得到这么一个写法
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<cstring>
using namespace std;
#define getchar() (frS==frT&&(frT=(frS=frBB)+fread(frBB,1,1<<12,stdin),frS==frT)?EOF:*frS++)
char frBB[1<<12]={},*frS=frBB,*frT=frBB;
inline int read()
{
int x=0;char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))x=x*10+(ch-'0'),ch=getchar();
return x;
}
#define add_edge(a,b,c) nxt[++tot]=head[a],head[a]=tot,to[tot]=b,val[tot]=c
int N,M,tot=0,mn=2147483647,curtotal=0,root=0;
int head[10005]={},to[20005]={},val[20005]={},nxt[20005]={};
int k[105]={};
int siz[10005]={},mxsiz[10005]={};
bool vis[10005]={};
int ans[105]={};
int dis[10005]={};
void getroot(int x,int fa)
{
mxsiz[x]=0,siz[x]=1;
for(int i=head[x];i;i=nxt[i])
{
if(to[i]==fa||vis[to[i]])continue;
getroot(to[i],x);
mxsiz[x]=max(mxsiz[x],siz[to[i]]);
siz[x]+=siz[to[i]];
}
mxsiz[x]=max(mxsiz[x],curtotal-siz[x]);
if(mxsiz[x]<mn)mn=mxsiz[x],root=x;
}
int getdis(int x,int fa,int l)
{
dis[++dis[0]]=l;
for(int i=head[x];i;i=nxt[i])
{
if(vis[to[i]]||to[i]==fa)continue;
getdis(to[i],x,l+val[i]);
}
}
void solve(int x,int add,int opt)
{
dis[0]=0; getdis(x,0,add);
sort(dis+1,dis+1+dis[0]);
for(int i=1;i<=M;++i)
for(int r=dis[0],l=1;l<dis[0];++l)
{
while((dis[r]+dis[l]>k[i])&&(r>l))--r;
if(r<=l)break;
if(dis[r]+dis[l]==k[i])ans[i]+=opt;
}
}
void divide(int x)
{
solve(x,0,1); vis[x]=1;
for(int i=head[x];i;i=nxt[i])
{
if(vis[to[i]])continue;
solve(to[i],val[i],-1);
mn=2147483647,curtotal=0,getroot(to[i],0);
divide(root);
}
}
int main()
{
freopen("fa.in","r",stdin); freopen("fa.out","w",stdout);
N=read();M=read();
for(int a,b,c,i=1;i<N;++i)
{
a=read();b=read();c=read();
add_edge(a,b,c); add_edge(b,a,c);
}
for(int i=1;i<=M;++i)k[i]=read();
mn=2147483647,curtotal=0,getroot(1,0);
divide(root);
for(int i=1;i<=M;++i)printf((ans[i])?"AYE\n":"NAY\n");
return 0;
}
然后T惨了 复杂度好像是 Θ ( 100 N l o g 2 N ) \Theta(100Nlog^2N) Θ(100Nlog2N)?
稍微修改了一下。↓
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<cstring>
using namespace std;
#define getchar() (frS==frT&&(frT=(frS=frBB)+fread(frBB,1,1<<12,stdin),frS==frT)?EOF:*frS++)
char frBB[1<<12]={},*frS=frBB,*frT=frBB;
inline int read()
{
int x=0;
register char c=getchar();
for(;!isdigit(c);c=getchar());
for(;isdigit(c);x=x*10+c-'0',c=getchar());
return x;
}
#define add_edge(a,b,c) nxt[++tot]=head[a],head[a]=tot,to[tot]=b,val[tot]=c
int N,M,tot=0,mn=2147483647,curtotal,root=0;
int head[10005]={},to[20005]={},val[20005]={},nxt[20005]={};
int k[10005]={};
int siz[10005]={},mxsiz[10005]={};
bool vis[10005]={};
bool ans[10005]={};
int dis[10005]={};
bool exist[10000005]={};
int ms[10005]={};
void getroot(int x,int fa)
{
mxsiz[x]=0,siz[x]=1;
for(int i=head[x];i;i=nxt[i])
{
if((!vis[to[i]])&&(to[i]!=fa))
{
getroot(to[i],x);
siz[x]+=siz[to[i]];
if(siz[to[i]]>mxsiz[x])mxsiz[x]=siz[to[i]];
}
}
mxsiz[x]=max(mxsiz[x],curtotal-siz[x]);
if(mxsiz[x]<mn)mn=mxsiz[x],root=x;
}
int getdis(int x,int fa,int l)
{
dis[++dis[0]]=l;
for(int i=head[x];i;i=nxt[i])
if((!vis[to[i]])&&(to[i]!=fa))getdis(to[i],x,l+val[i]);
}
void solve(int x,int add)
{
dis[0]=0; getdis(x,0,add);
for(int i=1;i<=dis[0];++i)
for(int j=1;j<=M;++j)
if(k[j]>=dis[i])ans[j]|=exist[k[j]-dis[i]];
for(int i=1;i<=dis[0];++i)exist[dis[i]]=1,ms[++ms[0]]=dis[i];
}
void divide(int x)
{
vis[x]=exist[0]=1; ms[0]=0;
for(int i=head[x];i;i=nxt[i])if(!vis[to[i]])solve(to[i],val[i]);
for(int i=1;i<=ms[0];++i)exist[ms[i]]=0;
for(int i=head[x];i;i=nxt[i])
{
if(!vis[to[i]])
{
mn=N,curtotal=siz[to[i]],getroot(to[i],x);
divide(root);
}
}
}
int main()
{
N=read();M=read();
for(int a,b,c,i=1;i<N;++i)
{
a=read();b=read();c=read();
add_edge(a,b,c); add_edge(b,a,c);
}
for(int i=1;i<=M;++i)k[i]=read();
mn=N,curtotal=N,getroot(1,0);
divide(root);
for(int i=1;i<=M;++i)puts((ans[i])?"AYE":"NAY");
return 0;
}
本来写完上面这份代码以为能A了,结果还是T
我就想咋回事 然后发现curtotal设错了 改好就A了
然后发现一开始写的代码改好curtotal也A了↓
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<cstring>
using namespace std;
#define getchar() (frS==frT&&(frT=(frS=frBB)+fread(frBB,1,1<<12,stdin),frS==frT)?EOF:*frS++)
char frBB[1<<12]={},*frS=frBB,*frT=frBB;
inline int read()
{
int x=0;char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))x=x*10+(ch-'0'),ch=getchar();
return x;
}
#define add_edge(a,b,c) nxt[++tot]=head[a],head[a]=tot,to[tot]=b,val[tot]=c
int N,M,tot=0,mn=2147483647,curtotal=0,root=0;
int head[10005]={},to[20005]={},val[20005]={},nxt[20005]={};
int k[105]={};
int siz[10005]={},mxsiz[10005]={};
bool vis[10005]={};
int ans[105]={};
int dis[10005]={};
void getroot(int x,int fa)
{
mxsiz[x]=0,siz[x]=1;
for(int i=head[x];i;i=nxt[i])
{
if(to[i]==fa||vis[to[i]])continue;
getroot(to[i],x);
mxsiz[x]=max(mxsiz[x],siz[to[i]]);
siz[x]+=siz[to[i]];
}
mxsiz[x]=max(mxsiz[x],curtotal-siz[x]);
if(mxsiz[x]<mn)mn=mxsiz[x],root=x;
}
int getdis(int x,int fa,int l)
{
dis[++dis[0]]=l;
for(int i=head[x];i;i=nxt[i])
{
if(vis[to[i]]||to[i]==fa)continue;
getdis(to[i],x,l+val[i]);
}
}
void solve(int x,int add,int opt)
{
dis[0]=0; getdis(x,0,add);
sort(dis+1,dis+1+dis[0]);
for(int i=1;i<=M;++i)
for(int r=dis[0],l=1;l<dis[0];++l)
{
while((dis[r]+dis[l]>k[i])&&(r>l))--r;
if(r<=l)break;
if(dis[r]+dis[l]==k[i])ans[i]+=opt;
}
}
void divide(int x)
{
solve(x,0,1); vis[x]=1;
for(int i=head[x];i;i=nxt[i])
{
if(vis[to[i]])continue;
solve(to[i],val[i],-1);
mn=N,curtotal=siz[to[i]],getroot(to[i],0);
divide(root);
}
}
int main()
{
N=read();M=read();
for(int a,b,c,i=1;i<N;++i)
{
a=read();b=read();c=read();
add_edge(a,b,c); add_edge(b,a,c);
}
for(int i=1;i<=M;++i)k[i]=read();
mn=N,curtotal=N,getroot(1,0);
divide(root);
for(int i=1;i<=M;++i)printf((ans[i])?"AYE\n":"NAY\n");
return 0;
}
怎么讲呢 感觉微妙
好像复杂度其实是 Θ ( K N l o g N ) \Theta(KNlogN) Θ(KNlogN)?