Submission #66942426

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint = atcoder::static_modint<998244353>;
// using mint = atcoder::static_modint<1000000007>;
using ld = long double;
using ll = long long;
#define mp(a,b) make_pair(a,b)
#define rep(i,s,n) for(int i=s; i<(int)n; i++)
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;
const vector<int> dx{1,0,-1,0},dy{0,1,0,-1};

mint op(mint x,mint y){return x*y;}
mint e(){return 1;}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;cin >> n;
    vector<vector<int>> a(n,vector<int>(6));
    vector<vector<int>> p(n*6);
    rep(i,0,n){
        rep(j,0,6)cin >> a[i][j];
        sort(a[i].begin(),a[i].end());
        rep(j,0,6)p[i*6+j]={a[i][j],i,j};
    }
    sort(p.begin(),p.end());
    segtree<mint,op,e> seg(n);
    mint ans=0;
    rep(i,0,n)seg.set(i,0);
    for(auto v:p){
        int x=v[0],i=v[1],j=v[2];
        seg.set(i,1);
        ans+=seg.all_prod()*x;
        // cout << x << " " << i << " " << j << " " << seg.all_prod().val() << "\n";
        seg.set(i,j+1);
    }
    ans/=mint(6).pow(n);
    cout << ans.val();
}

Submission Info

Judge Result