#325162 (C++14) No.803 Very Limited Xor Subset

提出ソース

結果

問題	No.803 Very Limited Xor Subset
ユーザー	tokoharu_procon
提出日時	2019-03-17 22:54:03
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	196 ms / 2,000 ms
コード長	6,416 bytes
コンパイル時間	2,134 ms
コンパイル使用メモリ	183,708 KB
実行使用メモリ	7,372 KB
最終ジャッジ日時	2024-07-08 01:25:13
合計ジャッジ時間	7,093 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	19 ms 7,300 KB
testcase_01	AC	19 ms 7,240 KB
testcase_02	AC	20 ms 7,368 KB
testcase_03	AC	20 ms 7,372 KB
testcase_04	AC	20 ms 7,368 KB
testcase_05	AC	20 ms 7,244 KB
testcase_06	AC	19 ms 7,240 KB
testcase_07	AC	18 ms 7,244 KB
testcase_08	AC	19 ms 7,364 KB
testcase_09	AC	19 ms 7,216 KB
testcase_10	AC	19 ms 7,244 KB
testcase_11	AC	20 ms 7,368 KB
testcase_12	AC	20 ms 7,372 KB
testcase_13	AC	19 ms 7,240 KB
testcase_14	AC	121 ms 7,128 KB
testcase_15	AC	138 ms 7,368 KB
testcase_16	AC	124 ms 7,368 KB
testcase_17	AC	134 ms 7,372 KB
testcase_18	AC	129 ms 7,368 KB
testcase_19	AC	123 ms 7,236 KB
testcase_20	AC	127 ms 7,240 KB
testcase_21	AC	115 ms 7,236 KB
testcase_22	AC	128 ms 7,300 KB
testcase_23	AC	173 ms 7,276 KB
testcase_24	AC	178 ms 7,368 KB
testcase_25	AC	187 ms 7,192 KB
testcase_26	AC	166 ms 7,244 KB
testcase_27	AC	157 ms 7,236 KB
testcase_28	AC	161 ms 7,372 KB
testcase_29	AC	144 ms 7,368 KB
testcase_30	AC	149 ms 7,368 KB
testcase_31	AC	196 ms 7,240 KB
testcase_32	AC	187 ms 7,240 KB
testcase_33	AC	180 ms 7,372 KB
testcase_34	AC	19 ms 7,240 KB
testcase_35	AC	68 ms 7,364 KB
testcase_36	AC	35 ms 7,244 KB
testcase_37	AC	49 ms 7,368 KB
testcase_38	AC	21 ms 7,244 KB
testcase_39	AC	21 ms 7,236 KB
testcase_40	AC	62 ms 7,360 KB
testcase_41	AC	83 ms 7,240 KB
testcase_42	AC	82 ms 7,372 KB
testcase_43	AC	66 ms 7,368 KB
testcase_44	AC	19 ms 7,240 KB
testcase_45	AC	19 ms 7,244 KB
testcase_46	AC	20 ms 7,368 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

main.cpp: In instantiation of 'auto exvector(const T&, SIZE_T ...) [with T = mint<1>; SIZE_T = {int, int}]':
main.cpp:222:24:   required from here
main.cpp:57:37: warning: narrowing conversion of 'dims#0' from 'int' to 'long unsigned int' [-Wnarrowing]
   57 |   std::vector<std::size_t> vec_dims{dims...};
      |                                     ^~~~
main.cpp:57:37: warning: narrowing conversion of 'dims#0' from 'int' to 'long unsigned int' [-Wnarrowing]
main.cpp:57:37: warning: narrowing conversion of 'dims#1' from 'int' to 'long unsigned int' [-Wnarrowing]
main.cpp:57:37: warning: narrowing conversion of 'dims#1' from 'int' to 'long unsigned int' [-Wnarrowing]

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;

// chmax, chmin
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

template <typename T>
function<T(T, T)> op_max = [](T a, T b) -> T { return max(a, b); };
template <typename T>
function<T(T, T)> op_min = [](T a, T b) -> T { return min(a, b); };

template <typename T>
function<T(T, T)> op_sum = [](T a, T b) -> T { return a + b; };

namespace detail {
template <typename T, std::size_t NDIMS>
struct vector_builder {
  using type = std::vector<typename vector_builder<T, NDIMS - 1>::type>;

  static type make(std::vector<std::size_t> dims, const T& v = {}) {
    const auto vec = std::vector<T>(dims.empty() ? 0 : dims.back(), v);
    if (!dims.empty()) dims.pop_back();
    return vector_builder<std::vector<T>, NDIMS - 1>::make(dims, vec);
  }
};

template <typename T>
struct vector_builder<T, 1> {
  using type = std::vector<T>;

  static type make(std::vector<std::size_t> dims, const T& v = {}) {
    return type(dims.empty() ? 0 : dims.back(), v);
  }
};
}  // namespace detail

template <typename T, typename... SIZE_T>
auto exvector(const T& v, SIZE_T... dims) {
  static_assert(sizeof...(dims) != 0, "invalid dimension");
  std::vector<std::size_t> vec_dims{dims...};
  return detail::vector_builder<T, sizeof...(dims)>::make(vec_dims, v);
}

using namespace std;
//********************  dumps ************************//

template <typename T>
void dump(const T& data, vector<int>& iter) {
  cout << data << " ";
}
template <typename T>
void dump(const vector<T>& data, vector<int>& iter) {
  for (auto elem : data) dump(elem, iter);
  cout << endl;
}

template <typename T>
void dump(const vector<vector<T>>& data, vector<int>& iter) {
  for (auto elem : iter) {
    cout << "[" << elem << "]";
  }
  cout << endl;
  for (int i = 0; i < data.size(); i++) {
    iter.push_back(i);
    dump(data[i], iter);
    iter.pop_back();
  }
  cout << endl;
}

template <typename T>
void dump(const vector<T>& data, int dummy) {
  for (int i = 0; i < data.size(); i++) {
    cout << "[" << i << "] " << data[i] << endl;
  }
}
template <typename T>
void dump(const T& data) {  // T : data, U = base type val.
  vector<int> iter;
  dump(data, iter);
}
///////////////////////////////////////////////

long long mul(long long a, long long b, const long long MOD) {
  return b ? (mul(a * 2, b / 2, MOD) + (b & 1 ? a : 0)) % MOD : 0;
}

long long bpow(long long a, long long b, const long long MOD) {
  return (b ? bpow(a * a % MOD, b / 2, MOD) * (b & 1 ? a : 1) : 1) % MOD;
}

long long inv(long long a, const long long MOD) {
  return bpow(a, MOD - 2, MOD);
}

vector<long long> MODS = {1000000007};
template <int kind = 0>
class mint {
 public:
  long long v;

  mint() : v(0) {}
  mint(long long v) : v((v % MODS[kind] + MODS[kind]) % MODS[kind]) {}
  long long get_mod() { return MODS[kind]; }
  long long get_val() { return v; }
};

template <int kind>
ostream& operator<<(ostream& os, const mint<kind>& x) {
  return os << x.v;
}

template <int kind>
bool operator==(mint<kind>& a, mint<kind> b) {
  return a.v == b.v;
}

template <int kind>
mint<kind>& operator+=(mint<kind>& a, mint<kind> b) {
  return a = a.v + b.v;
}
template <int kind>
mint<kind>& operator-=(mint<kind>& a, mint<kind> b) {
  return a = a.v - b.v;
}
template <int kind>
mint<kind>& operator*=(mint<kind>& a, mint<kind> b) {
  return a = a.v * b.v;
}
template <int kind>
mint<kind>& operator/=(mint<kind>& a, mint<kind> b) {
  return a = a.v * inv(b.v, a.get_mod());
}
template <int kind>
mint<kind> operator+(mint<kind> a, mint<kind> b) {
  return a += b;
}
template <int kind>
mint<kind> operator-(mint<kind> a, mint<kind> b) {
  return a -= b;
}
template <int kind>
mint<kind> operator*(mint<kind> a, mint<kind> b) {
  return a *= b;
}
template <int kind>
mint<kind> operator/(mint<kind> a, mint<kind> b) {
  return a /= b;
}
template <int kind>
mint<kind>& operator+=(mint<kind>& a, long long b) {
  return a = a.v + b;
}
template <int kind>
mint<kind>& operator-=(mint<kind>& a, long long b) {
  return a = a.v - b;
}
template <int kind>
mint<kind>& operator*=(mint<kind>& a, long long b) {
  return a = a.v * b;
}
template <int kind>
mint<kind>& operator/=(mint<kind>& a, long long b) {
  return a = a.v * inv(b, a.get_mod());
}
template <int kind>
mint<kind> operator+(mint<kind> a, long long b) {
  return a += b;
}
template <int kind>
mint<kind> operator-(mint<kind> a, long long b) {
  return a -= b;
}
template <int kind>
mint<kind> operator*(mint<kind> a, long long b) {
  return a *= b;
}
template <int kind>
mint<kind> operator/(mint<kind> a, long long b) {
  return a /= b;
}

vector<mint<>> kaijo;
void init() {
  kaijo.push_back(mint<>(1));
  for (int i = 1; i <= 400000; i++) {
    kaijo.push_back(kaijo.back() * i);
  }
}

mint<> comb(LL N, LL K) {
  if (K < 0) return mint<>(0);
  if (K > N) return mint<>(0);
  return kaijo[N] / kaijo[N - K] / kaijo[K];
}

int main() {
  init();
  MODS.push_back(2);
  mint<> ans;
  int N, M, X;
  cin >> N >> M >> X;

  int base = 30;
  auto table = exvector(mint<1>(0), N + 1, M + base);
  for (int i = 0; i <= N; i++) {
    int v;
    if (i < N)
      cin >> v;
    else
      v = X;
    for (int j = 0; j < base; j++) {
      table[i][j] = (0 < ((1 << j) & v));
    }
  }
  for (int j = base; j < M + base; j++) {
    int t, l, r;
    cin >> t >> l >> r;
    l--;
    r--;
    for (int i = l; i <= r; i++) {
      table[i][j] = 1;
    }
    table[N][j] = t;
  }
  mint<1> one = mint<1>(1);
  mint<1> zero = mint<1>(0);

  int piv = 0;
  vector<PII> pivs;
  for (int j = 0; j < M + base; j++) {
    if (piv == N) continue;
    int pos = -1;
    for (int i = piv; i < N; i++) {
      if (table[i][j] == one) {
        pos = i;
      }
    }
    if (pos == -1) continue;
    swap(table[pos], table[piv]);
    for (int i = 0; i <= N; i++) {
      if (i == piv) continue;
      if (table[i][j] == zero) continue;
      for (int j = 0; j < M + base; j++) {
        table[i][j] += table[piv][j];
      }
    }
    pivs.push_back(PII(j, piv));
    piv++;
  }
  ans = 1;
  for (int j = 0; j < M + base; j++) {
    if (table[N][j] == one) ans = 0;
  }
  for (int i = piv; i < N; i++) ans *= 2;

  cout << ans << endl;
  return 0;
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード