提出 #75484739

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define pb push_back

template<class T> inline bool chmax(T& a, T b) { return a < b ? a = b, 1 : 0; }
template<class T> inline bool chmin(T& a, T b) { return a > b ? a = b, 1 : 0; }

const int MOD = 998244353;

ll bpow(ll base,ll exp){
    ll res=1;
    base%=MOD;
    while(exp>0){
        if(exp&1)res=(res*base)%MOD;
        base=(base*base)%MOD;
        exp/=2;
    }
    return res;
}
void solve() {

    int n,m;cin>>n>>m;
    // can count compilnertary counting , array not having a nujmber;
    vector<vector<pair<int,int>>> freq(n*m+1);
    for(int i=0;i<n;i++){
        vector<int> row(m);
        for(int j=0;j<m;j++)cin>>row[j] ;
        sort(all(row));
        for(int j=0;j<m;j++){
            int k=j;
            while(k<m&&row[k]==row[j])k++;
            freq[row[j]].pb({i,k-j});
            j=k-1;
        }
    }
    ll total=bpow(m,n);
    ll ans=0;
    ll maxi=n*m;
    for(int x=1;x<=maxi;x++){
        if(freq[x].empty())continue;
        
        ll without=bpow(m,n-freq[x].size());
        for(auto&p:freq[x]){
            int cnt=p.second;
            without=(without*(m-cnt))%MOD;


        }
        ll with=(total-without+MOD)%MOD;
        ans=(ans+with  )%MOD;
    }
    cout<<ans<<'\n';


    
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int tt = 1;
    //cin>>tt;
    while (tt--) {
        solve();
    }

    return 0;
}

提出情報

ジャッジ結果