結果

問題 No.1167 Graduation Trip
ユーザー 👑 emthrmemthrm
提出日時 2020-08-12 00:18:15
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,714 ms / 4,000 ms
コード長 6,980 bytes
コンパイル時間 2,997 ms
コンパイル使用メモリ 220,680 KB
実行使用メモリ 7,808 KB
最終ジャッジ日時 2024-04-17 17:57:36
合計ジャッジ時間 25,702 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 667 ms
7,552 KB
testcase_01 AC 874 ms
7,552 KB
testcase_02 AC 647 ms
7,424 KB
testcase_03 AC 661 ms
7,552 KB
testcase_04 AC 658 ms
7,552 KB
testcase_05 AC 909 ms
7,552 KB
testcase_06 AC 661 ms
7,552 KB
testcase_07 AC 840 ms
7,552 KB
testcase_08 AC 693 ms
7,552 KB
testcase_09 AC 1,002 ms
7,680 KB
testcase_10 AC 1,123 ms
7,680 KB
testcase_11 AC 1,131 ms
7,552 KB
testcase_12 AC 1,132 ms
7,808 KB
testcase_13 AC 1,124 ms
7,680 KB
testcase_14 AC 1,128 ms
7,680 KB
testcase_15 AC 1,491 ms
7,552 KB
testcase_16 AC 1,141 ms
7,296 KB
testcase_17 AC 1,128 ms
7,680 KB
testcase_18 AC 1,714 ms
7,680 KB
testcase_19 AC 1,127 ms
7,552 KB
testcase_20 AC 12 ms
5,376 KB
testcase_21 AC 16 ms
5,376 KB
testcase_22 AC 12 ms
5,376 KB
testcase_23 AC 16 ms
5,376 KB
testcase_24 AC 16 ms
5,376 KB
testcase_25 AC 11 ms
5,376 KB
testcase_26 AC 11 ms
5,376 KB
testcase_27 AC 16 ms
5,376 KB
testcase_28 AC 16 ms
5,376 KB
testcase_29 AC 11 ms
5,376 KB
testcase_30 AC 74 ms
5,376 KB
testcase_31 AC 181 ms
7,040 KB
testcase_32 AC 214 ms
7,040 KB
testcase_33 AC 14 ms
7,552 KB
testcase_34 AC 15 ms
7,552 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
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int mod = MOD;
struct ModInt {
  unsigned val;
  ModInt(): val(0) {}
  ModInt(ll x) : val(x >= 0 ? x % mod : x % mod + mod) {}
  ModInt pow(ll exponent) const {
    ModInt tmp = *this, res = 1;
    while (exponent > 0) {
      if (exponent & 1) res *= tmp;
      tmp *= tmp;
      exponent >>= 1;
    }
    return res;
  }
  ModInt &operator+=(const ModInt &x) { if((val += x.val) >= mod) val -= mod; return *this; }
  ModInt &operator-=(const ModInt &x) { if((val += mod - x.val) >= mod) val -= mod; return *this; }
  ModInt &operator*=(const ModInt &x) { val = static_cast<unsigned long long>(val) * x.val % mod; return *this; }
  ModInt &operator/=(const ModInt &x) {
    // assert(__gcd(static_cast<int>(x.val), mod) == 1);
    unsigned a = x.val, b = mod; int u = 1, v = 0;
    while (b) {
      unsigned tmp = a / b;
      swap(a -= tmp * b, b);
      swap(u -= tmp * v, v);
    }
    return *this *= u;
  }
  bool operator==(const ModInt &x) const { return val == x.val; }
  bool operator!=(const ModInt &x) const { return val != x.val; }
  bool operator<(const ModInt &x) const { return val < x.val; }
  bool operator<=(const ModInt &x) const { return val <= x.val; }
  bool operator>(const ModInt &x) const { return val > x.val; }
  bool operator>=(const ModInt &x) const { return val >= x.val; }
  ModInt &operator++() { if (++val == mod) val = 0; return *this; }
  ModInt operator++(int) { ModInt res = *this; ++*this; return res; }
  ModInt &operator--() { val = (val == 0 ? mod : val) - 1; return *this; }
  ModInt operator--(int) { ModInt res = *this; --*this; return res; }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { return ModInt(val ? mod - val : 0); }
  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; }
  friend ostream &operator<<(ostream &os, const ModInt &x) { return os << x.val; }
  friend istream &operator>>(istream &is, ModInt &x) { ll val; is >> val; x = ModInt(val); return is; }
};
ModInt abs(const ModInt &x) { return x; }
struct Combinatorics {
  int val; // "val!" and "mod" must be disjoint.
  vector<ModInt> fact, fact_inv, inv;
  Combinatorics(int val = 10000000) : val(val), fact(val + 1), fact_inv(val + 1), inv(val + 1) {
    fact[0] = 1;
    FOR(i, 1, val + 1) fact[i] = fact[i - 1] * i;
    fact_inv[val] = ModInt(1) / fact[val];
    for (int i = val; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i;
    FOR(i, 1, val + 1) inv[i] = fact[i - 1] * fact_inv[i];
  }
  ModInt nCk(int n, int k) const {
    if (n < 0 || n < k || k < 0) return ModInt(0);
    // assert(n <= val && k <= val);
    return fact[n] * fact_inv[k] * fact_inv[n - k];
  }
  ModInt nPk(int n, int k) const {
    if (n < 0 || n < k || k < 0) return ModInt(0);
    // assert(n <= val);
    return fact[n] * fact_inv[n - k];
  }
  ModInt nHk(int n, int k) const {
    if (n < 0 || k < 0) return ModInt(0);
    return k == 0 ? ModInt(1) : nCk(n + k - 1, k);
  }
};

template <int D>
struct Basis {
  vector<bitset<D>> v;
  vector<int> msb;

  bool add(bitset<D> val) {
    int n = v.size();
    if (n == D) return false;
    REP(i, n) {
      if (val[msb[i]]) val ^= v[i];
    }
    if (val.none()) return false;
    int m = D - 1;
    while (!val[m]) --m;
    if (v.empty()) {
      v.emplace_back(val);
      msb.emplace_back(m);
      return true;
    }
    int idx = n - distance(msb.rbegin(), upper_bound(msb.rbegin(), msb.rend(), m));
    v.emplace(v.begin() + idx, val);
    msb.emplace(msb.begin() + idx, m);
    for (int i = n; i > idx; --i) {
      if (v[idx][msb[i]]) v[idx] ^= v[i];
    }
    for (int i = idx - 1; i >= 0; --i) {
      if (v[i][m]) v[i] ^= v[idx];
    }
    return true;
  }

  bool add(ll val) { return add(bitset<D>(val)); }

  int rank() const { return v.size(); }

  inline bool operator<(const Basis &x) const {
    int n = v.size();
    if (n != x.v.size()) return n < x.v.size();
    if (n == D) return false;
    REP(i, n) {
      if (msb[i] != x.msb[i]) return msb[i] < x.msb[i];
    }
    REP(i, n) {
      if (v[i] != x.v[i]) {
        for (int j = msb[i] - 1; ; --j) {
          if (v[i][j] != x.v[i][j]) return v[i][j] < x.v[i][j];
        }
      }
    }
    return false;
  }
};

template <typename Monoid>
struct SegmentTree {
  using Fn = function<Monoid(Monoid, Monoid)>;

  SegmentTree(int sz, Fn fn, const Monoid UNITY) : fn(fn), UNITY(UNITY) {
    init(sz);
    dat.assign(n << 1, UNITY);
  }

  SegmentTree(const vector<Monoid> &a, Fn fn, const Monoid UNITY) : fn(fn), UNITY(UNITY) {
    int a_sz = a.size();
    init(a_sz);
    dat.resize(n << 1);
    REP(i, a_sz) dat[i + n] = a[i];
    for (int i = n - 1; i > 0; --i) dat[i] = fn(dat[i << 1], dat[(i << 1) + 1]);
  }

  void update(int node, Monoid val) {
    node += n;
    dat[node] = val;
    while (node >>= 1) dat[node] = fn(dat[node << 1], dat[(node << 1) + 1]);
  }

  Monoid query(int left, int right) const {
    Monoid l_res = UNITY, r_res = UNITY;
    for (left += n, right += n; left < right; left >>= 1, right >>= 1) {
      if (left & 1) l_res = fn(l_res, dat[left++]);
      if (right & 1) r_res = fn(dat[--right], r_res);
    }
    return fn(l_res, r_res);
  }

  Monoid operator[](const int idx) const { return dat[idx + n]; }

private:
  int n = 1;
  Fn fn;
  const Monoid UNITY;
  vector<Monoid> dat;

  void init(int sz) { while (n < sz) n <<= 1; }
};

int main() {
  int n, q; cin >> n >> q;
  vector<Basis<32>> a(n);
  REP(i, n) {
    uint32_t ai; cin >> ai;
    a[i].add(ai);
  }
  auto f = [](Basis<32> a, Basis<32> b) {
    for (auto e : b.v) a.add(e);
    return a;
  };
  SegmentTree<Basis<32>> seg(a, f, Basis<32>());
  while (q--) {
    int m; cin >> m;
    vector<int> b(m + 2);
    b[0] = -1;
    FOR(i, 1, m + 1) cin >> b[i], --b[i];
    b[m + 1] = n - 1;
    ModInt ans = 1;
    FOR(i, 1, m + 2) ans *= ModInt(2).pow(b[i] - b[i - 1] - seg.query(b[i - 1] + 1, b[i] + 1).rank());
    cout << ans << '\n';
  }
  return 0;
}
0