結果

問題 No.1167 Graduation Trip
ユーザー Mister
提出日時 2020-08-18 07:33:32
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 5,609 bytes
コンパイル時間 1,355 ms
コンパイル使用メモリ 97,408 KB
最終ジャッジ日時 2025-01-13 02:50:55
ジャッジサーバーID
（参考情報） 		judge2 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 2 WA * 33
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <vector>
#include <functional>

template <int MOD>
struct ModInt {
    using lint = long long;
    int val;

    // constructor
    ModInt(lint v = 0) : val(v % MOD) {
        if (val < 0) val += MOD;
    };

    // unary operator
    ModInt operator+() const { return ModInt(val); }
    ModInt operator-() const { return ModInt(MOD - val); }
    ModInt inv() const { return this->pow(MOD - 2); }

    // arithmetic
    ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; }
    ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; }
    ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; }
    ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; }
    ModInt pow(lint n) const {
        auto x = ModInt(1);
        auto b = *this;
        while (n > 0) {
            if (n & 1) x *= b;
            n >>= 1;
            b *= b;
        }
        return x;
    }

    // compound assignment
    ModInt& operator+=(const ModInt& x) {
        if ((val += x.val) >= MOD) val -= MOD;
        return *this;
    }
    ModInt& operator-=(const ModInt& x) {
        if ((val -= x.val) < 0) val += MOD;
        return *this;
    }
    ModInt& operator*=(const ModInt& x) {
        val = lint(val) * x.val % MOD;
        return *this;
    }
    ModInt& operator/=(const ModInt& x) { return *this *= x.inv(); }

    // compare
    bool operator==(const ModInt& b) const { return val == b.val; }
    bool operator!=(const ModInt& b) const { return val != b.val; }
    bool operator<(const ModInt& b) const { return val < b.val; }
    bool operator<=(const ModInt& b) const { return val <= b.val; }
    bool operator>(const ModInt& b) const { return val > b.val; }
    bool operator>=(const ModInt& b) const { return val >= b.val; }

    // I/O
    friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept {
        lint v;
        is >> v;
        x = v;
        return is;
    }
    friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; }
};

template <class T>
struct SegmentTree {
    using Merger = std::function<T(T, T)>;

    int length;
    std::vector<T> dat;
    T unit;
    Merger merge;

    SegmentTree() = default;

    SegmentTree(int n, const T& unit, const Merger& merge)
        : length(1), unit(unit), merge(merge) {
        while (length < n) length <<= 1;
        dat.assign(length * 2, unit);
    }

    template <class Container>
    SegmentTree(const Container& elems, const T& unit, const Merger& merge)
        : length(1), unit(unit), merge(merge) {
        int n = elems.size();
        while (length < n) length <<= 1;

        dat.assign(length * 2, unit);

        std::copy(elems.begin(), elems.end(), dat.begin() + length);

        for (int nidx = length - 1; nidx >= 1; --nidx) {
            T vl = dat[nidx * 2 + 0];
            T vr = dat[nidx * 2 + 1];
            dat[nidx] = merge(vl, vr);
        }
    }

    void update(int nidx, const T& elem) {
        nidx += length;
        dat[nidx] = elem;

        while (nidx > 0) {
            nidx >>= 1;
            T vl = dat[nidx * 2 + 0];
            T vr = dat[nidx * 2 + 1];
            dat[nidx] = merge(vl, vr);
        }
    }

    T fold(int ql, int qr) const {
        ql = std::max(ql, 0);
        qr = std::min(qr, length);
        ql += length, qr += length;

        T lacc = unit, racc = unit;
        while (ql < qr) {
            if (ql & 1) {
                lacc = merge(lacc, dat[ql]);
                ++ql;
            }
            if (qr & 1) {
                --qr;
                racc = merge(dat[qr], racc);
            }
            ql >>= 1, qr >>= 1;
        }

        return merge(lacc, racc);
    }

    T get(int idx) const { return dat[idx + length]; }
    T fold_all() const { return dat[1]; }
};

void bool_elimination(std::vector<int>& mat) {
    int n = mat.size();

    for (int l = 0; l < n; ++l) {
        {
            auto& v = *std::max_element(mat.begin() + l, mat.end());
            std::swap(v, mat[l]);
        }

        const auto& v = mat[l];
        for (int i = l + 1; i < n; ++i) {
            auto u = mat[i];
            u ^= v;
            if (u < mat[i]) std::swap(u, mat[i]);
        }
    }
}

bool independent(std::vector<int> bs, int v) {
    bs.push_back(v);
    bool_elimination(bs);
    return bs.back() != 0;
}

struct Linear {
    std::vector<int> basis;
    int corank;

    Linear() : corank(0) {}

    void add(int b) {
        if (independent(basis, b)) {
            basis.push_back(b);
        } else {
            ++corank;
        }
    }
};

constexpr int MOD = 1000000007;
using mint = ModInt<MOD>;

void solve() {
    int n, q;
    std::cin >> n >> q;

    std::vector<Linear> ls(n);
    for (auto& l : ls) {
        int b;
        std::cin >> b;
        if (b == 0) {
            ++l.corank;
        } else {
            l.basis.push_back(b);
        }
    }

    SegmentTree<Linear>
        seg(ls, Linear(), [](Linear p, const Linear& q) {
            p.corank += q.corank;
            for (auto b : q.basis) p.add(b);
            return p;
        });

    while (q--) {
        int m;
        std::cin >> m;

        std::vector<int> rs(m);
        for (auto& r : rs) std::cin >> r;
        rs.push_back(n);

        int e = 0, l = 0;
        for (auto r : rs) {
            e += seg.fold(l, r).corank;
            l = r;
        }

        std::cout << mint(2).pow(e) << "\n";
    }
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}
0