【hdu 4812】点分治

预处理逆元后点分治。

被G++坑惨了，扩栈只能用C++。。

#pragma comment(linker,"/STACK:102400000,102400000")
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#define Rep(i, x, y) for (int i = x; i <= y; i ++)
#define RepE(i, x) for (int i = pos[x]; i; i = g[i].nex)
#define Dwn(i, x, y) for (int i = x; i >= y; i --)
using namespace std;
typedef long long LL;
const int mod = 1000003, N = 100005, M = mod + 3;
struct arr { int y, nex; } g[N * 2];
int n, sz, pos[N], siz, t[N], f[N], st[M], top, v[M], a1, a2, rt, o;
LL p[M], n0 = 1, a[N], m;
bool don[N], ty, vis[N];
void Init(int x, int y);
void Init(int x, int y) {
    g[++ sz].y = y;
    g[sz].nex = pos[x];
    pos[x] = sz;
}
LL Pow(LL x, int y) {
    LL z = 1;
    while (y) {
        if (y & 1) (z *= x) %= mod;
        (x *= x) %= mod, y /= 2;
    }
    return z;
}
void Get(int x) {
    t[x] = vis[x] = 1, f[x] = 0;
    RepE(i, x) {
        if (!vis[g[i].y] && !don[g[i].y])
            Get(g[i].y), t[x] += t[g[i].y], f[x] = max(f[x], t[g[i].y]);
    }
    f[x] = max(f[x], siz - t[x]);
    if (f[x] < f[rt]) rt = x;
    vis[x] = 0;
}
void Dfs(int x, int s) {
    vis[x] = 1;
    if (ty == 0) {
        o = m * p[s] % mod;
        if (v[o]) {
            int k1 = min(v[o], x), k2 = max(v[o], x);
            if ((k1 < a1) || (a1 == k1 && k2 < a2)) 
                a1 = k1, a2 = k2;
        }
    } else {
        if (!v[s]) v[s] = x, st[++ top] = s;
        else v[s] = min(v[s], x);
    }
    RepE(i, x) {
        if (!don[g[i].y] && !vis[g[i].y]) {
            Dfs(g[i].y, s * a[g[i].y] % mod);
        }
    }
    vis[x] = 0;
}
void Check(int x) {    
    v[1] = x;
    RepE(i, x) {
        if (!don[g[i].y]) {
            ty = 0, Dfs(g[i].y, a[x] * a[g[i].y] % mod);
            ty = 1, Dfs(g[i].y, a[g[i].y]);
        }
    }
    while (top) v[ st[top --] ] = 0;
}
void Work(int x) {
    don[x] = 1;
    Check(x);
    RepE(i, x) {
        if (don[g[i].y]) continue ;
        siz = t[g[i].y];
        rt = 0, Get(g[i].y), Work(rt);
    }
}
int main()
{
    Rep(i, 2, mod-1) n0 = n0 * i % mod;
    p[mod-1] = Pow(n0, mod-2);
    Dwn(i, mod-2, 1) p[i] = p[i+1] * (i+1) % mod;
    n0 = 1;
    Rep(i, 1, mod-1) (p[i] *= n0) %= mod, n0 = n0 * i % mod;
    int x, y;
    while (scanf ("%d%d", &n, &m) != EOF) {
        memset(pos, 0, sizeof(pos)), sz = 0;
        memset(don, 0, sizeof(don));
        a1 = a2 = n + 1;
        Rep(i, 1, n) scanf ("%d", &a[i]);
        Rep(i, 1, n-1) {
            scanf ("%d%d", &x, &y);
            Init(x, y), Init(y, x);
        }
        f[0] = siz = n;
        rt = 0, Get(1), Work(rt);
        if (a1 == n + 1) puts("No solution");
        else printf ("%d %d\n", a1, a2);
    }

    return 0;
}