結果

問題 No.803 Very Limited Xor Subset
ユーザー E31415926
提出日時 2019-03-20 01:03:39
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 3 ms / 2,000 ms
コード長 3,156 bytes
コンパイル時間 915 ms
コンパイル使用メモリ 102,880 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-14 16:06:18
合計ジャッジ時間 2,201 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge6
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 43
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<stack>
#include<cstring>
#include<utility>
#include<cmath>
#include<assert.h>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<complex>
#include<bitset>
#define int long long
using namespace std;
#define rep(i, n) for(int i=0;i<(n);++i)
typedef pair<int, int> pii;
const int INF = 1l << 60;
#define u_b upper_bound
#define l_b lower_bound
const int MAX_ROW = 610;
const int MAX_COL = 610;
struct BitMatrix {
    int n, m;
    bitset<MAX_COL> val[MAX_ROW];
    BitMatrix(int n = 1, int m = 1) : n(n), m(m) {}
    inline bitset<MAX_COL> &operator[](int i) { return val[i]; }
};
int linear_equation(BitMatrix A, vector<int> b) {
    int rank = 0;
    rep(i, A.n)A[i][A.m] = b[i];
    rep(i, A.m) {
        int pivot = -1;
        for (int j = rank; j < A.n; ++j) {
            if (A[j][i]) {
                pivot = j;
                break;
            }
        }
        if (pivot != -1) {
            swap(A[pivot], A[rank]);
            rep(j, A.n)if (j != rank && A[j][i])A[j] ^= A[rank];
            ++rank;
        }
    }
    for (int i = rank; i < A.n; ++i)if (A[i][A.m])return -1;
    return rank;
}
//const int mod = //998244353;
const int mod = 1000000007;
const int FacN = 0;//使わないなら0
constexpr int power(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1)res *= a;
        a *= a;
        res %= mod;
        a %= mod;
        b /= 2;
    }
    return res;
}
constexpr int inv(int x) {
    return power(x, mod - 2);
}
const struct Fac {
    int val[FacN];
    constexpr Fac() : val() {
        if (FacN == 0)return;
        val[0] = 1;
        for (int i = 1; i < FacN; ++i) val[i] = val[i - 1] * i % mod;
    }
    const int &operator[](size_t i) const {
        return val[i];
    }
} fac;
const struct FacInv {
    int val[FacN];
    constexpr FacInv() : val() {
        if (FacN == 0)return;
        val[FacN - 1] = 1;
        for (int i = 1; i < FacN; ++i)val[FacN - 1] = val[FacN - 1] * i % mod;
        val[FacN - 1] = inv(val[FacN - 1]);
        for (int i = FacN - 1; i >= 1; --i)val[i - 1] = val[i] * i % mod;
    }
    const int &operator[](size_t i) const {
        return val[i];
    }
} fac_inv;
int Perm(int n, int r) {
    if (n < r) return 0;
    return fac[n] * fac_inv[n - r] % mod;
}
int Comb(int n, int r) {
    return Perm(n, r) * fac_inv[r] % mod;
}
//mod,Factorial書き換え
//要検証
const int DIGIT = 35;
signed main() {
    int N, M, X;
    cin >> N >> M >> X;
    vector<int> a(N);
    rep(i, N) cin >> a[i];
    BitMatrix A(DIGIT + M, N);
    vector<int> b(DIGIT + M);
    rep(d, DIGIT) {
        rep(i, N) {
            if (a[i] & (1ll << d))A[d][i] = 1;
        }
        if (X & (1ll << d))b[d] = 1;
    }
    for (int d = 0; d < M; ++d) {
        int type, l, r;
        cin >> type >> l >> r;
        --l, --r;
        for (int i = l; i <= r; ++i)A[d + DIGIT][i] = 1;
        b[d + DIGIT] = type;
    }
    int rank = linear_equation(A, b);
    if (rank == -1)cout << 0 << endl;
    else cout << power(2, N - rank) << endl;
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0