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
| #include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
struct PairHash {
inline std::size_t operator()(const std::pair<int, int> &v) const { return v.first * 31 + v.second; }
};
#define M_PI 3.14159265358979323846
#define MAX_N 202020
#define INF 987654321
#define EPS 1e-9
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vall3 vector<array<ll,3>>
#define all3 array<ll,3>
#define all5 array<ll,5>
#define vall5 vector<all5>
#define vll vector<ll>
#define vi vector<int>
#define vs vector<string>
#define usll unordered_set<ll>
#define uspll unordered_set<pll, PairHash>
#define umll unordered_map<ll,ll>
#define vvs vector<vs>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
ll __gcd(ll x, ll y) { return !y ? x : __gcd(y, x % y); }
using namespace std;
ll helper(vector<umll>& dp, vvll& A, ll x, ll p, ll now = 1) {
if(p == A.size()) return x == now;
if(now > x) return 0;
if(dp[p].count(now)) return dp[p][now];
ll& res = dp[p][now] = 0;
ll lim = floor(x / now);
for(auto& a : A[p]) {
if(a > lim) break;
res += helper(dp,A, x, p + 1, now * a);
}
return res;
}
ll solve(vvll &A, ll x) {
ll n = A.size();
for(auto& a : A) sort(all(a));
vector<umll> dp(n);
return helper(dp, A, x, 0);
}
int main() {
ios_base::sync_with_stdio(0);
ios::sync_with_stdio(0);
cin.tie(0);
cout.precision(12);
ll tc = 1;
for (ll i = 1; i <= tc; i++) {
ll n, x;
cin>>n>>x;
vvll A(n);
for (ll j = 0, c; j < n; j++) {
cin>>c;
A[j] = vll(c);
for(ll k = 0; k < c; k++) cin>>A[j][k];
}
cout << solve(A, x) << endl;
}
return 0;
}
|
