-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathd.cpp
68 lines (60 loc) · 1.58 KB
/
d.cpp
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
#include <bits/stdc++.h>
#define f first
#define s second
#define endl "\n"
#define int ll
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <typename T1, typename T2>
ostream &operator <<(ostream &os, pair<T1, T2> p){os << p.first << " " << p.second; return os;}
template <typename T>
ostream &operator <<(ostream &os, vector<T> &v){for(T i : v)os << i << ", "; return os;}
template <typename T>
ostream &operator <<(ostream &os, set<T> s){for(T i : s) os << i << ", "; return os;}
template <typename T1, typename T2>
ostream &operator <<(ostream &os, map<T1, T2> m){for(pair<T1, T2> i : m) os << i << endl; return os;}
int MOD = 998244353;
int N;
int k[1000000];
vi a[1000000];
int occ[1000001];
ll fexp(ll a, ll b){
ll ans = 1;
for(int i = 0; i < 35; i++){
if(b&(1LL<<i)){
ans *= a;
}
a *= a;
a %= MOD;
ans %= MOD;
}
return ans;
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N;
for(int i = 0; i < N; i++){
cin >> k[i];
for(int j = 0; j < k[i]; j++){
int x; cin >> x;
a[i].push_back(x);
occ[x]++;
}
}
int ans = 0;
for(int i = 0; i < N; i++){
for(int j = 0; j < k[i]; j++){
int cnum = occ[a[i][j]];
int cden = N * k[i] % MOD * N % MOD;
ans += cnum * fexp(cden, MOD-2) % MOD;
ans %= MOD;
}
}
//cout << num << " " << den << endl;
//int inv = fexp(den, MOD-2);
cout << ans << endl;
return 0;
}