1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240 | #include <bits/stdc++.h>
#define fp(i, a, b) for (int i = (a), i##_ = (b) + 1; i < i##_; ++i)
#define fd(i, a, b) for (int i = (a), i##_ = (b) - 1; i > i##_; --i)
#define file(s) freopen(s".in","r",stdin),freopen(s".out","w",stdout)
using namespace std;
const int N = 5e5 + 5, P = 998244353;
using arr = int[N];
using ll = int64_t;
/*---------------------------------------------------------------------------*/
class Cipolla {
int P, I2{};
using pll = pair<ll, ll>;
#define X first
#define Y second
ll mul(ll a, ll b) const { return a * b % P; }
pll mul(pll a, pll b) const { return {(a.X * b.X + I2 * a.Y % P * b.Y) % P, (a.X * b.Y + a.Y * b.X) % P}; }
template<class T> T POW(T a, int b, T x) { for (; b; b >>= 1, a = mul(a, a)) if (b & 1) x = mul(x, a); return x; }
public:
Cipolla(int p = 0) : P(p) {}
pair<int, int> sqrt(int n) {
int a = rand(), x;
if (!(n %= P))return {0, 0};
if (POW(n, (P - 1) >> 1, 1) == P - 1) return {-1, -1};
while (POW(I2 = ((ll) a * a - n + P) % P, (P - 1) >> 1, 1) == 1) a = rand();
x = (int) POW(pll{a, 1}, (P + 1) >> 1, {1, 0}).X;
if (2 * x > P) x = P - x;
return {x, P - x};
}
#undef X
#undef Y
};
/*---------------------------------------------------------------------------*/
#define ADD(a, b) (((a) += (b)) >= P ? (a) -=P : 0) // (a += b) %= P
#define SUB(a, b) (((a) -= (b)) < 0 ? (a) += P: 0) // ((a -= b) += P) %= P
#define MUL(a, b) ((ll) (a) * (b) % P)
//vector<int> getInv(int L) {
// vector<int> inv(L); inv[1] = 1;
// fp(i, 1, L - 1) inv[i] = MUL((P - P / i), inv[P % i]);
// return inv;
//}
//auto inv = getInv(N); // NOLINT
int POW(ll a, int b = P - 2, ll x = 1) { for (; b; b >>= 1, a = a * a % P) if (b & 1) x = x * a % P; return x; }
//int INV(int a) { return a < N ? inv[a] : POW(a); }
namespace NTT {
const int g = 3;
vector<int> Omega(int L) {
int wn = POW(g, P / L);
vector<int> w(L); w[L >> 1] = 1;
fp(i, L / 2 + 1, L - 1) w[i] = MUL(w[i - 1], wn);
fd(i, L / 2 - 1, 1) w[i] = w[i << 1];
return w;
}
auto W = Omega(1 << 21); // NOLINT
void DIF(int *a, int n) {
for (int k = n >> 1; k; k >>= 1)
for (int i = 0, y; i < n; i += k << 1)
fp(j, 0, k - 1)
y = a[i + j + k], a[i + j + k] = MUL(a[i + j] - y + P, W[k + j]), ADD(a[i + j], y);
}
void IDIT(int *a, int n) {
for (int k = 1; k < n; k <<= 1)
for (int i = 0, x, y; i < n; i += k << 1)
fp(j, 0, k - 1)
x = a[i + j], y = MUL(a[i + j + k], W[k + j]),
a[i + j + k] = x - y < 0 ? x - y + P : x - y, ADD(a[i + j], y);
int Inv = P - (P - 1) / n;
fp(i, 0, n - 1) a[i] = MUL(a[i], Inv);
reverse(a + 1, a + n);
}
}
namespace Polynomial {
using Poly = std::vector<int>;
// mul/div int
Poly &operator*=(Poly &a, int b) { for (auto &x : a) x = MUL(x, b); return a; }
Poly operator*(Poly a, int b) { return a *= b; }
Poly operator*(int a, Poly b) { return b * a; }
Poly &operator/=(Poly &a, int b) { return a *= POW(b); }
Poly operator/(Poly a, int b) { return a /= b; }
// Poly add/sub
Poly &operator+=(Poly &a, Poly b) {
a.resize(max(a.size(), b.size()));
fp(i, 0, b.size() - 1) ADD(a[i], b[i]);
return a;
}
Poly operator+(Poly a, Poly b) { return a += b; }
Poly &operator-=(Poly &a, Poly b) {
a.resize(max(a.size(), b.size()));
fp(i, 0, b.size() - 1) SUB(a[i], b[i]);
return a;
}
Poly operator-(Poly a, Poly b) { return a -= b; }
// Poly mul
void DFT(Poly &a) { NTT::DIF(a.data(), a.size()); }
void IDFT(Poly &a) { NTT::IDIT(a.data(), a.size()); }
int norm(int n) { return 1 << (32 - __builtin_clz(n - 1)); }
void norm(Poly &a) { if (!a.empty()) a.resize(norm(a.size()), 0); }
Poly &dot(Poly &a, Poly &b) {
fp(i, 0, a.size() - 1) a[i] = MUL(a[i], b[i]);
return a;
}
Poly operator*(Poly a, Poly b) {
int n = a.size() + b.size() - 1, L = norm(n);
if (a.size() <= 8 || b.size() <= 8) {
Poly c(n);
fp(i, 0, a.size() - 1) fp(j, 0, b.size() - 1)
c[i + j] = (c[i + j] + (ll) a[i] * b[j]) % P;
return c;
}
a.resize(L), b.resize(L);
DFT(a), DFT(b), dot(a, b), IDFT(a);
return a.resize(n), a;
}
// Poly inv
Poly Inv2k(Poly a) { // a.size() = 2^k
int n = a.size(), m = n >> 1;
if (n == 1) return {POW(a[0])};
Poly b = Inv2k(Poly(a.begin(), a.begin() + m)), c = b;
b.resize(n), DFT(a), DFT(b), dot(a, b), IDFT(a);
fp(i, 0, n - 1) a[i] = i < m ? 0 : P - a[i];
DFT(a), dot(a, b), IDFT(a);
return move(c.begin(), c.end(), a.begin()), a;
}
Poly Inv(Poly a) {
int n = a.size();
norm(a), a = Inv2k(a);
return a.resize(n), a;
}
// Poly div/mod
Poly operator/(Poly a,Poly b){
int k = a.size() - b.size() + 1;
if (k < 0) return {0};
reverse(a.begin(), a.end());
reverse(b.begin(), b.end());
b.resize(k), a = a * Inv(b);
a.resize(k), reverse(a.begin(), a.end());
return a;
}
pair<Poly, Poly> operator%(Poly a, const Poly& b) {
Poly c = a / b;
a -= b * c, a.resize(b.size() - 1);
return {c, a};
}
// Poly sqrt
Poly Sqrt(Poly a) {
int n = a.size(), k = norm(n);
Poly b = {(new Cipolla(P))->sqrt(a[0]).first}, c;
a.resize(k * 2, 0);
for (int L = 2; L <= k; L <<= 1) {
b.resize(2 * L, 0), c = Poly(a.begin(), a.begin() + L) * Inv(b);
fp(i, 0, 2 * L - 1) b[i] = MUL(b[i] + c[i], (P + 1) / 2);
}
return b.resize(n), b;
}
// Poly calculus
void Derivative(Poly &a) {
fp(i, 1, a.size() - 1) a[i - 1] = MUL(i, a[i]);
a.pop_back();
}
}
using namespace Polynomial;
long long fac[N + 5], invfac[N + 5];
long long th[N + 5];
long long C(int n,int m)
{
if(n<0 || n<m)
return 0;
else
return fac[n] * invfac[m] % P * invfac[n - m] % P;
}
long long a[N + 5], b[N + 5];
Poly p[N + 5];
bool vis[N + 5];
int num[N + 5];
int cnt = 0;
int main()
{
th[0] = 1;
for (int i = 1; i <= N;i++)
th[i] = th[i - 1] * 2 % P;
fac[0] = fac[1] = 1;
for (int i = 2; i <= N;i++)
fac[i] = fac[i - 1] * i % P;
invfac[N] = POW(fac[N]);
for (int i = N - 1; i >= 1;i--)
invfac[i] = invfac[i + 1] * (i + 1) % P;
invfac[0] = invfac[1] = 1;
int n, m = 0;
int ttt;
scanf("%d", &ttt);
while(ttt -- ) {
int k;
scanf("%d%d", &n, &k);
for(int i = 1; i <= n; i ++ ) scanf("%d", &a[i]);
memset(vis, false, sizeof(vis));
cnt = 0;
for(int i = 1; i <= n; i ++ ) {
if(!vis[i]) {
vis[i] = true;
num[cnt] = 1;
long long t = a[i];
while(!vis[t]) {
vis[t] = true;
num[cnt] ++ ;
t = a[t];
}
if(num[cnt] > 1) cnt ++ ;
}
}
for(int i = 0; i < cnt; i ++ ) {
long long sz = num[i];
p[i].resize(sz + 1);
for(long long j = 0; j <= sz; j ++ ) {
p[i][j] = (C(sz - j - 1LL, j - 1LL) + C(sz - j, j)) % P; // p[i]表示i的生成函数
}
}
function<Poly(int, int)> calc = [&](int L, int R)
{
if (L == R)
return p[L];
int mid = (L + R) >> 1;
return calc(L, mid) * calc(mid + 1, R);
};
auto now = calc(0, cnt - 1);
printf("%d\n", now[k]);
}
return 0;
}
|
