[完全平方数 随机化权值Xor] UR #14 A 最强跳蚤

把数质因数分解 完全平方数对应每个质数的指数是偶数

两个点之间的路径是完全平方数 对应两个点到根路径的每个质数的指数奇偶性相同

那么我们给每个质数一个[0,1<<64)的权值

然后一路xor

然后hash或者map都行

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<map>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
  return *p1++;
}

inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()) if (c=='-') b=-1;
}

const int N=100005;

struct edge{
  int u,v,w,next;
}G[N<<1];
int head[N],inum;

inline void add(int u,int v,int w,int p){
  G[p].u=u; G[p].v=v; G[p].w=w; G[p].next=head[u]; head[u]=p;
}

const int maxn=10000;
int prime[maxn+5],num;
int vst[maxn+5];

inline ull ran(){
  return (ull)rand()*rand();
}

int n;
ull val[maxn+5];
map<int,ull> Val;
map<ull,int> Cnt;
typedef map<ull,int>::iterator ITER;

inline void Pre(){
  for (int i=2;i<=maxn;i++){
    if (!vst[i]) prime[++num]=i,val[i]=ran();
    for (int j=1;j<=num && (ll)prime[j]*i<=maxn;j++){
      vst[prime[j]*i]=1;
      if (i%prime[j]==0) break;
    }
  }
}

ull S[N];
#define V G[p].v
inline void dfs(int u,int fa){
  Cnt[S[u]]++;
  for (int p=head[u];p;p=G[p].next)
    if (V!=fa){
      S[V]=S[u]; int tem=G[p].w;
      for (int j=1;j<=num && prime[j]*prime[j]<=G[p].w;j++)
	while (tem%prime[j]==0)
	  tem/=prime[j],S[V]^=val[prime[j]];
      if (tem!=1){
	if (tem<=maxn)
	  S[V]^=val[tem];
	else if (Val.find(tem)!=Val.end())
	  S[V]^=Val[tem];
	else
	  S[V]^=(Val[tem]=ran());
      }
      dfs(V,u);   
    }
}

int main(){
  int iu,iv,iw;
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  read(n); Pre();
  for (int i=1;i<n;i++)
    read(iu),read(iv),read(iw),add(iu,iv,iw,++inum),add(iv,iu,iw,++inum);
  dfs(1,0);
  ll Ans=0;
  for (ITER it=Cnt.begin();it!=Cnt.end();it++)
    Ans+=(ll)(it->second-1)*it->second/2;
  printf("%lld\n",Ans<<1);
  return 0;
}