HDU - 4812 D Tree 树分治好题+逆元+HASH

题目链接：https://cn.vjudge.net/problem/HDU-4812

题意：找到两点路径上点乘积%mod=k，要求字典序最小

题解：之前写的都是容斥写的，也就是先处理根，然后减去孩子，但是这个要求明确找到两点，所以就不能这么搞了。因此要一个分支一个分支的处理，mp[i]记录下之前分支，根节点到某一点路径上的点乘积为i时的最小节点编号，因为a * b % mod = k， 已知a，要找b，所以要用到逆元，预处理出1-mod的逆元，要注意，一个子分支都处理完之后才能对mp进行更新，整个分支处理完之后mp要清空。注意要找的是个路径，一个点不算，改了老久了，不容易啊。。

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
const ll mod = 1e6 + 3;
#define INF 0x3f3f3f3f
struct EDGE {
    int to, d, nex;
}e[N * 2];
int n, pnum;
ll k;
int head[N], len;
int vis[N];
int son[N], max_son[N];
ll inv[mod + 10], mp[mod + 10];
ll val[N], pval[N];
int id[N], tot;
ll ksm(ll x, ll y) {
    ll res = 1;
    while(y) {
        if(y & 1) res = res * x % mod;
        y >>= 1;
        x = x * x % mod;
    }
    return res;
}
void Init() {
    for(int i = 0 ; i <= n; i++) {
        head[i] = -1;
        vis[i] = 0;
    }

    len = 0;
}
void AddEdge(int x, int y, int z) {
    e[len].to = y;
    e[len].d = z;
    e[len].nex = head[x];
    head[x] = len++;
}
void getroot(int u, int fa, int &root, int &minn) {
    son[u] = 1;
    max_son[u] = 0;
    int to;
    for(int i = head[u]; i != -1; i = e[i].nex) {
        to = e[i].to;
        if(to == fa || vis[to]) continue;
        getroot(to, u, root, minn);
        son[u] += son[to];
        max_son[u] = max(max_son[u], son[to]);
    }
    max_son[u] = max(max_son[u], pnum - son[u]);
    if(max_son[u] < minn) {
        minn = max_son[u];
        root = u;
    }
}
int ansfrom, ansto;
void getdis(int u, int fa, ll d) {
    d = d * val[u] % mod;
    id[++tot] = u;
    pval[tot] = d;
    int to;
    for(int i = head[u]; i != -1; i = e[i].nex) {
        to = e[i].to;
        if(to == fa || vis[to]) continue;
        getdis(to, u, d );
    }
}

void dfs(int u) {
    int minn = N, root;
    getroot(u, -1, root, minn);
    vis[root] = 1;
    mp[val[root]] = root;
    int to, id1, id2;
    ll tmp;
    for(int i = head[root]; i != -1; i = e[i].nex) {
        to = e[i].to;
        if(vis[to]) continue;
        tot = 0;
        getdis(to, root, 1);
        for(int j = 1; j <= tot; j++) {
            tmp = k * inv[pval[j]] % mod;
            if(mp[tmp]) {
                id1 = mp[tmp];
                id2 = id[j];
                if(id1 > id2) swap(id1, id2);
                if(id1 < ansfrom || (id1 == ansfrom && id2 < ansto)) {
                    ansfrom = id1;
                    ansto = id2;
                }
            }
        }
        for(int j = 1; j <= tot; j ++) {
            pval[j] = pval[j] * val[root] % mod;
            if(mp[pval[j]] == 0 || mp[pval[j]] > id[j])
                   mp[pval[j]] = id[j];
        }
    }
    mp[val[root]] = 0;
    for(int i = head[root]; i != -1; i = e[i].nex) {
        to = e[i].to;
        if(vis[to] ) continue;
        tot = 0;
        getdis(to, root, val[root]);
        for(int j = 1; j <= tot; j++) mp[pval[j]] = 0;
    }
    for(int i = head[root]; i != -1; i = e[i].nex) {
        to = e[i].to;
        if(vis[to]) continue;
        pnum = son[to];
        dfs(to);
    }
}
int main() {
    int x, y, z = 1;
    for(int i = 1; i < mod; i++) {
        inv[i] = ksm(i, mod - 2);
    }
    while(~scanf("%d %d", &n, &k)) {
        Init();
        for(int i = 1; i <= n; i++)scanf("%lld", &val[i]);
        for(int i = 1; i < n; i++) {
            scanf("%d %d", &x, &y);
            AddEdge(x, y, z);
            AddEdge(y, x, z);
        };
        ansfrom = INF;
        pnum = n;
        dfs(1);
        if(ansfrom == INF) printf("No solution\n");
        else printf("%d %d\n", ansfrom, ansto);
    }

    return 0;
}