Submission #4215915

---

Source Code Expand

#include<bits/stdc++.h>
#define int long long
#define N 300004
#define LL long long
#define ULL unsigned long long
#define pp pair<int,int>
#define mp make_pair
#define pb push_back
#define ff first
#define dd second
#define REP(i,n) for(int i=0;i<(n);++i)
#define FWD(i,a,b) for (int i=(a); i<(b); ++i)
#define BCK(i,a,b) for (int i=(a); i>(b); --i)
#define SIZE(c) ((int)((c).size()))
#define ALL(u) (u).begin(),(u).end()
#define K 41
LL fpw(LL a, ULL b, LL p){
    LL r = 1; while(b){if(b&1) r=r*a%p; a=a*a%p; b/=2;} return (LL)r;
}

using namespace std;
int n, m,a,b,k;

int mod = 998244353;

bitset<301> tab[301];

int potTwo[301];

int newton[301][301];

int potThree[301];

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin >> n >> m;

    for(int i = 0; i  < 301; ++i) for(int j = 0; j < 301; ++j) newton[i][j] = 0;
    for(int i = 0; i < 301; ++i) newton[i][0] = 1;
    for(int i = 1; i < 301; ++i) {
        for(int j = 1; j <= i; ++j) {
            newton[i][j] = (newton[i-1][j-1] + newton[i-1][j]) % mod;
        }
    }

    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < m; ++j) {
           int temp; cin >> temp;
            tab[i].set(j,temp);
        }
    }

    int row = 0;
    for(int col = 0; col < m; ++col) {
        for(int i = row; i < n; ++i) {
            if (tab[i][col]) {
                swap(tab[i], tab[row]); break;
            }
        }
        if (row < n && tab[row][col]) {
            for(int i = row+1; i < n; ++i) {
                if(tab[i][col]) tab[i] ^= tab[row];
            }
            row++;
        }
    }

   /* cout << "row " << row << endl;

    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < m; ++j) {
            cout << tab[i][j] << " ";
        }
        cout << endl;
    }*/

    potTwo[0] = potThree[0] = 1;
    for(int i = 1; i < 301; ++i) potTwo[i] = potTwo[i-1]*2 % mod;
    for(int i = 1; i < 301; ++i) potThree[i] = potThree[i-1]*3 % mod;

    int ans = potTwo[n-row]*potTwo[m-row] % mod;
    int ile = 0;
    for(int i = 1; i <= row; i += 2) {
        ile += potThree[row-i]*newton[row][i] % mod;
        ile %= mod;
    }
    ans *= ile;
    ans %= mod;
    cout << ans << endl;
}

Submission Info

Judge Result