题解
设法把求和的式子化成i,j分开,然后固定一个点统计贡献
点的距离用点分化成深度之和,然后phi这样化
经过一系列化简,用到对因数和倍数进行容斥,最后变成预处理sumphi(g):当前层g的倍数的phi和,这个对每个点的贡献系数可以预处理
预处理部分题解写得麻烦了。仔细把容斥的式子展开(看题解,很详细),发现g对于任意g的倍数x贡献系数相同,直接在线性筛的时候预处理
我推出来是s[g] = g / phi[g] - d / phi[d] (d | g且d != g)
这道题反复利用ai互不相同,所有1-n的数的因数个数是nlnn的,用倍数和因数容斥。把复杂的式子化简,最后简洁的表达和计算。
化简路径成都用到点分。O(nlnnlogn)
并且这道题显然不是繁衍的模型,因为每个点点权不规则,不应该往这方面想。
这道题同样可以繁衍:只要是减去倍数来容斥的模型,都有两种做法:
1. 直接枚举倍数
2. 用莫比乌斯繁衍
关于繁衍,这里有详细叙述 。要用到虚树。代码复杂度和时间复杂度都一样
这份代码还是WA的,待调。或许是我式子推错了 求大佬指教
#include<bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for(register int i = l ; i <= r ; i++)
#define repd(i,r,l) for(register int i = r ; i >= l ; i--)
#define rvc(i,S) for(register int i = 0 ; i < (int)S.size() ; i++)
#define rvcd(i,S) for(register int i = ((int)S.size()) - 1 ; i >= 0 ; i--)
#define fore(i,x)for (register int i = head[x] ; i ; i = e[i].next)
#define forup(i,l,r) for (register int i = l ; i <= r ; i += lowbit(i))
#define fordown(i,id) for (register int i = id ; i ; i -= lowbit(i))
#define pb push_back
#define prev prev_
#define stack stack_
#define mp make_pair
#define fi first
#define se second
#define lowbit(x) (x&(-x))
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> pr;
const int inf = 1e9 + 10;
const int N = 3e5 + 10;
const int maxn = 3020;
const ll mod = 1e9 + 7;
struct node{
int next,to;
}e[N * 2];
int head[N];
int prime[N],cnt,tag[N],phi[N],mn[N];
ll s[N],inv[N],ans,sum[N];
int vis[N],sz[N],fa[N],tot,dth[N];
vector <int> vec[N],rec;
int n,a[N],rt;
inline void factor(int n){
rep(i,1,n){
if ( i * i > n ) break;
if ( n % i == 0 ){
vec[n].pb(n / i);
if ( n / i != i ) vec[n].pb(i);
}
}
sort(vec[n].begin(),vec[n].end());
}
void init(){
int n = 100;
cnt = 0;
s[1] = 1 , phi[1] = 1 , inv[1] = 1;
rep(i,2,n) inv[i] = (mod - inv[mod % i] * (mod / i) % mod) % mod;
rep(i,2,n){
if ( !tag[i] ) prime[++cnt] = i , phi[i] = i - 1 , s[i] = (inv[i - 1] * i + 1) % mod;
rep(j,1,cnt){
if ( prime[j] * i > n ) break;
tag[i * prime[j]] = 1;
int x = i,c = 1;
while ( x % prime[j] == 0 ) x /= prime[j] , c++;
s[i * prime[j]] = s[x] * (c * inv[prime[j] - 1] % mod * prime[j] + 1) % mod;
if ( i % prime[j] == 0 ){
phi[i * prime[j]] = phi[i] * prime[j];
break;
}
phi[i * prime[j]] = phi[i] * (prime[j] - 1);
}
}
rep(i,1,n) s[i] = (mod - s[i] + 2 * i * inv[phi[i]]) % mod;
// rep(i,1,n) cout<<s[i]<<" ";
// cout<<endl;
// cout<<phi[20]<<endl;
rep(i,1,n) factor(i);
}
inline void adde(int x,int y){
e[++cnt].to = y;
e[cnt].next = head[x];
head[x] = cnt;
}
void getsz(int x,int fa){
tot++;
fore(i,x){
if ( e[i].to == fa || vis[e[i].to] ) continue;
getsz(e[i].to,x);
}
}
void getrt(int x,int fa){
sz[x] = 1;
fore(i,x){
if ( e[i].to == fa || vis[e[i].to] ) continue;
getrt(e[i].to,x);
sz[x] += sz[e[i].to];
}
if ( max(tot - sz[x],sz[x]) < max(tot - sz[rt],sz[rt]) ) rt = x;
}
void dfs(int x,int fa){
rvc(i,vec[a[x]]){
sum[vec[a[x]][i]] += phi[a[x]];
rec.pb(vec[a[x]][i]);
}
fore(i,x){
if ( e[i].to == fa || vis[e[i].to] ) continue;
dth[e[i].to] = dth[x] + 1;
dfs(e[i].to,x);
}
}
inline void up(ll &x,ll y){ x = (x + y) % mod; }
void dfs_ans(int x,int fa,int t){
rvc(i,vec[a[x]]){
int g = vec[a[x]][i];
up(ans,t * sum[g] % mod * s[g] % mod * dth[x] % mod * phi[a[x]] * 2);
}
fore(i,x){
if ( e[i].to == fa || vis[e[i].to] ) continue;
dfs_ans(e[i].to,x,t);
}
}
inline void clear(){
rvc(i,rec) sum[rec[i]] = 0;
rec.clear();
}
void getans(){
ans = 0;
dth[rt] = 0 , dfs(rt,0);
dfs_ans(rt,0,1);
clear();
fore(i,rt){
if ( vis[e[i].to] ) continue;
dfs(e[i].to,rt);
dfs_ans(e[i].to,rt,-1);
clear();
}
cout<<rt<<" "<<(ans % mod + mod) % mod<<endl;
}
void solve(int x){
tot = 0 , getsz(x,0);
if ( tot == 1 ) return;
rt = x , getrt(x,0);
getans();
vis[rt] = 1;
fore(i,rt){
if ( vis[e[i].to] ) continue;
solve(e[i].to);
}
}
int main(){
freopen("input.txt","r",stdin);
scanf("%d",&n);
rep(i,1,n) scanf("%d",&a[i]);
rep(i,1,n - 1){
int x,y;
scanf("%d %d",&x,&y);
adde(x,y) , adde(y,x);
}
init();
solve(1);
printf("%lld\n",(ans * inv[n] % mod * inv[n - 1] % mod + mod) % mod);
}