Submission #4221314


Source Code Expand

Copy
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const {
        long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u);
    }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r;
}
typedef ModInt<998244353> mint;
int gaussianEliminationXOR(vector<vector<int>> A) {
    int n = A.size(), m = A[0].size(), r = 0;
    for (int i = 0; r < n && i < m; ++i) {
        int to = r;
        rep(j, r + 1, n) if (A[j][i] > A[to][i]) to = j;
        A[r].swap(A[to]);
        if (A[r][i] == 0) continue;
        rep(j, r + 1, n) rrep(k, m - 1, i) A[j][k] ^= A[r][k] & A[j][i];
        r++;
    }
    return r;
}
/*---------------------------------------------------------------------------------------------------
            ∧_∧  
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     
    /   \     | |     
    /   / ̄ ̄ ̄ ̄/  |  
  __(__ニつ/     _/ .| .|____  
     \/____/ (u ⊃  
---------------------------------------------------------------------------------------------------*/







int N, M;
int v[606];
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> N >> M;

    vector<vector<int>> v(N, vector<int>(M));

    rep(i, 0, N) rep(j, 0, M) {
        int a; cin >> a;
        v[i][j] = a;
    }

    int R = gaussianEliminationXOR(v);

    mint ans = ((mint(2) ^ N) - (mint(2) ^ (N-R))) * (mint(2) ^ (M - 1));
    cout << ans << endl;
}

Submission Info

Submission Time
Task E - Odd Subrectangles
User hamayanhamayan
Language C++14 (GCC 5.4.1)
Score 800
Code Size 3787 Byte
Status AC
Exec Time 15 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 800 / 800
Status
AC × 2
AC × 50
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt AC 15 ms 1024 KB
02.txt AC 15 ms 1024 KB
03.txt AC 15 ms 1024 KB
04.txt AC 15 ms 1024 KB
05.txt AC 15 ms 1024 KB
06.txt AC 15 ms 1024 KB
07.txt AC 15 ms 1024 KB
08.txt AC 15 ms 1024 KB
09.txt AC 15 ms 1024 KB
10.txt AC 15 ms 1024 KB
11.txt AC 7 ms 1024 KB
12.txt AC 7 ms 1024 KB
13.txt AC 8 ms 1024 KB
14.txt AC 8 ms 1024 KB
15.txt AC 9 ms 1024 KB
16.txt AC 10 ms 1024 KB
17.txt AC 12 ms 1024 KB
18.txt AC 14 ms 1024 KB
19.txt AC 15 ms 1024 KB
20.txt AC 7 ms 1024 KB
21.txt AC 4 ms 512 KB
22.txt AC 2 ms 384 KB
23.txt AC 1 ms 256 KB
24.txt AC 4 ms 512 KB
25.txt AC 1 ms 256 KB
26.txt AC 1 ms 256 KB
27.txt AC 3 ms 384 KB
28.txt AC 2 ms 384 KB
29.txt AC 1 ms 256 KB
30.txt AC 4 ms 512 KB
31.txt AC 3 ms 512 KB
32.txt AC 4 ms 640 KB
33.txt AC 4 ms 640 KB
34.txt AC 4 ms 512 KB
35.txt AC 3 ms 512 KB
36.txt AC 2 ms 256 KB
37.txt AC 2 ms 384 KB
38.txt AC 5 ms 512 KB
39.txt AC 8 ms 640 KB
40.txt AC 2 ms 384 KB
41.txt AC 1 ms 256 KB
42.txt AC 1 ms 256 KB
43.txt AC 1 ms 256 KB
44.txt AC 1 ms 256 KB
45.txt AC 1 ms 256 KB
46.txt AC 1 ms 256 KB
47.txt AC 1 ms 256 KB
48.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB