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
|
#include <bits/stdc++.h>
#define all(vec) vec.begin(),vec.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define pb push_back
#define SZ(a) ((int) a.size())
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (int i = (a); i >= (b); --i)
#define debug(var) cerr << #var <<":"<<var<<"\n";
#define lson(var) (var<<1)
#define rson(var) ((var<<1)+1)
using namespace std;
typedef long long ll;typedef unsigned long long ull;
typedef double DB;typedef long double LD;
typedef __int128 i128;typedef pair<DB,DB> pdd;typedef pair<ll,bool> plb;
typedef pair<ll,ll> pll;
typedef array<ll,3> arr3;typedef array<ll,2> arr2;
constexpr ll MAXN=static_cast<ll>(1e6)+10,INF=static_cast<ll>(1e17)+9;
constexpr ll mod=998244353;
constexpr double eps=1e-8;
ll N,M,Q,X,K,lT,A[MAXN][10];
inline void init(){
}
ll binpow(ll a,ll k,const ll &p){
ll res=1;
while(k>0){
if((k&1)==1) res=a*res%p;
a=a*a%p;
k>>=1;
}
return res;
}
inline void solve(){
cin>>N;
init();
vector<ll> li;
li.pb(-INF);
priority_queue<arr2> pq;
FOR(i,1,N){
FOR(j,1,6){
cin>>A[i][j];
li.pb(A[i][j]);
pq.push({A[i][j],i});
}
}
sort(all(li));
li.resize(unique(all(li))-li.begin());
ll lsz=SZ(li)-1;
vector<arr2> dp(lsz+5,{0,0});
dp[lsz][0]=1,dp[lsz][1]=1;
vector<ll> cnt(N+5,6);
vector<ll> org(N+5,0);
ROF(_,lsz-1,1){
ll val=li[_+1];ll fac1=1,fac2=1;
vector<ll> wp;
while(pq.empty()==false && pq.top()[0]==val){
ll id=pq.top()[1];
pq.pop();
org[id]=max(cnt[id],org[id]);
cnt[id]--;
wp.pb(id);
}
sort(all(wp));wp.resize(unique(all(wp))-wp.begin());
FOR(i,0,SZ(wp)-1){
ll id=wp[i];
fac1*=cnt[id];fac1%=mod;
fac2*=org[id];fac2%=mod;
org[id]=0;
}
dp[_][0]=dp[_+1][0]*fac1%mod;
dp[_][1]=dp[_+1][1]*fac2%mod;
#ifdef LOCAL
debug(_);
debug(dp[_][0]);
debug(dp[_][1]);
debug(fac1);debug(fac2);debug(val);
#endif
}
ll ans=0;
dp[0][1]=1;
ROF(i,lsz,1){
ll lans=0;
ll fac1=dp[i][0]*dp[i-1][1]-dp[i-1][0]*dp[i][1];fac1%=mod;
ll fac2=dp[i][1]*dp[i-1][1];fac2%=mod;
#ifdef LOCAL
cerr<<"---------\n";
debug(fac1);debug(fac2);
#endif
fac2=binpow(fac2,mod-2,mod);
lans=fac1*fac2%mod*li[i]%mod;
ans+=lans;ans%=mod;
}
if(ans<0) ans+=mod;
cout<<ans<<"\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
solve();
return 0;
}
|
