Codeforces 1230 E
也没怎么读题,就看了下样例的note就知道了是对树上的直系祖先对子结点的链上gcd求和,然后就可以直接这样去跑一遍。
个人比较的喜欢踩坑,有正着走的不走,偏偏选择了从根节点返回回来的答案,这样的做法虽然上是也没有问题,但是呢MLE了,就比较的真实。
正解是直接向下递推即可了,同时子结点继承父节点的答案,以此类推得到最后的答案。
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define efs 1e-7
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MP(a, b) make_pair(a, b)
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 1e5 + 1;
const ll mod = 1e9 + 7;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
int N, cnt, head[maxN];
ll a[maxN], ans;
map<ll, int> mp[maxN];
map<ll, int>::iterator it;
struct Eddge
{
int nex, to;
Eddge(int a=-1, int b=0):nex(a), to(b) {}
}edge[maxN<<1];
inline void addEddge(int u, int v)
{
edge[cnt] = Eddge(head[u], v);
head[u] = cnt++;
}
inline void _add(int u, int v) { addEddge(u, v); addEddge(v, u); }
void dfs(int u, int fa)
{
mp[u][a[u]]++;
if(fa)
{
ll GD;
for(it = mp[fa].begin(); it != mp[fa].end(); it++)
{
GD = gcd(it->first, a[u]);
mp[u][GD] += it->second;
if(mp[u][GD] > mod) mp[u][GD] %= mod;
ans = (ans + GD * it->second) % mod;
}
}
ans = (ans + a[u]) % mod;
for(int i=head[u], v; ~i; i=edge[i].nex)
{
v = edge[i].to;
if(v == fa) continue;
dfs(v, u);
}
}
inline void init()
{
cnt = 0; ans = 0;
for(int i=1; i<=N; i++) head[i] = -1;
}
int main()
{
scanf("%d", &N);
init();
for(int i=1; i<=N; i++) scanf("%lld", &a[i]);
for(int i=1, u, v; i<N; i++)
{
scanf("%d%d", &u, &v);
_add(u, v);
}
dfs(1, 0);
printf("%lld\n", ans);
return 0;
}