原题传送门
计数DP
- 并查集维护连通性
- 令 d p u dp_u dpu表示以 u u u为根的答案
- 若将 v v v连到 u u u的下面,则 d p u = d p u ∗ d p v ∗ C s i z e u + s i z e v − 1 s i z e v dp_u=dp_u*dp_v*C_{size_u+size_v-1}^{size_v} dpu=dpu∗dpv∗Csizeu+sizev−1sizev(因为整棵树中只有根是一定要最小的那个数,其他随意,所以乘法原理)
Code:
#include <bits/stdc++.h>
#define maxn 300010
#define LL long long
using namespace std;
const LL qy = 1e9 + 7;
LL dp[maxn], fac[maxn], inv[maxn];
int n, m, f[maxn], size[maxn];
inline int read(){
int s = 0, w = 1;
char c = getchar();
for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
for (; isdigit(c); c = getchar()) s =(s << 1) + (s << 3) + (c ^ 48);
return s * w;
}
LL ksm(LL n, LL k){
LL sum = 1;
for (; k; k >>= 1, n = n * n % qy) if (k & 1) sum = sum * n % qy;
return sum;
}
LL C(int m, int n){ return fac[m] * inv[m - n] % qy * inv[n] % qy; }
int getfa(int k){ return f[k] == k ? k : f[k] = getfa(f[k]); }
int main(){
n = read(), m = read();
fac[1] = 1;
for (int i = 2; i <= n; ++i) fac[i] = fac[i - 1] * i % qy;
inv[n] = ksm(fac[n], qy - 2);
for (int i = n; i; --i) inv[i - 1] = inv[i] * i % qy;
for (int i = 0; i < n; ++i) f[i] = i, size[i] = dp[i] = 1;
LL ans = 0;
while (m--){
int opt = read();
if (opt == 1){
int x = getfa((read() + ans) % n), y = getfa((read() + ans) % n);// printf("modest%d %d\n", x,y);
f[x] = y, size[y] += size[x], dp[y] = dp[y] * dp[x] % qy * C(size[y] - 1, size[x]) % qy;
} else printf("%lld\n", ans = dp[getfa((read() + ans) % n)]);
}
return 0;
}