#532490 (C++17) No.1167 Graduation Trip

• 問題: No.1167 Graduation Trip
• ユーザー: Mister
• 提出日時: 2020-08-18 07:41:52
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 1,010 ms / 4,000 ms
• コード長: 5,123 bytes
• コンパイル時間: 1,361 ms
• コンパイル使用メモリ: 102,416 KB
• 実行使用メモリ: 5,760 KB
• 最終ジャッジ日時: 2024-04-20 01:49:32
• 合計ジャッジ時間: 17,365 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	680 ms; 5,760 KB
testcase_01	AC	467 ms; 5,632 KB
testcase_02	AC	339 ms; 5,760 KB
testcase_03	AC	588 ms; 5,760 KB
testcase_04	AC	620 ms; 5,504 KB
testcase_05	AC	485 ms; 5,632 KB
testcase_06	AC	609 ms; 5,632 KB
testcase_07	AC	455 ms; 5,632 KB
testcase_08	AC	353 ms; 5,632 KB
testcase_09	AC	515 ms; 5,760 KB
testcase_10	AC	955 ms; 5,504 KB
testcase_11	AC	1,010 ms; 5,760 KB
testcase_12	AC	942 ms; 5,504 KB
testcase_13	AC	951 ms; 5,504 KB
testcase_14	AC	938 ms; 5,632 KB
testcase_15	AC	759 ms; 5,632 KB
testcase_16	AC	554 ms; 5,504 KB
testcase_17	AC	928 ms; 5,760 KB
testcase_18	AC	909 ms; 5,632 KB
testcase_19	AC	917 ms; 5,632 KB
testcase_20	AC	7 ms; 5,376 KB
testcase_21	AC	9 ms; 5,376 KB
testcase_22	AC	7 ms; 5,376 KB
testcase_23	AC	9 ms; 5,376 KB
testcase_24	AC	9 ms; 5,376 KB
testcase_25	AC	7 ms; 5,376 KB
testcase_26	AC	6 ms; 5,376 KB
testcase_27	AC	9 ms; 5,376 KB
testcase_28	AC	9 ms; 5,376 KB
testcase_29	AC	7 ms; 5,376 KB
testcase_30	AC	35 ms; 5,376 KB
testcase_31	AC	89 ms; 5,632 KB
testcase_32	AC	113 ms; 5,504 KB
testcase_33	AC	7 ms; 5,632 KB
testcase_34	AC	7 ms; 5,760 KB
testcase_35	AC	2 ms; 5,376 KB
testcase_36	AC	2 ms; 5,376 KB
testcase_37	AC	2 ms; 5,376 KB

ソースコード

#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]; }
};

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

using uint = unsigned int;

bool independent(std::vector<uint> bs, uint& v) {
    for (auto b : bs) v = std::min(v, b ^ v);
    return v != 0;
}

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

    Linear() : corank(0) {}

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

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

    std::vector<Linear> ls(n);
    for (auto& l : ls) {
        uint b;
        std::cin >> b;
        l.add(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;
}