結果
| 問題 | No.803 Very Limited Xor Subset |
| ユーザー |
 rniya
|
| 提出日時 | 2021-06-03 17:46:22 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 3 ms / 2,000 ms |
| コード長 | 9,136 bytes |
| コンパイル時間 | 2,252 ms |
| コンパイル使用メモリ | 201,652 KB |
| 最終ジャッジ日時 | 2025-01-21 21:19:38 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 43 |
ソースコード
#define LOCAL#include <bits/stdc++.h>using namespace std;#pragma region Macrostypedef long long ll;typedef __int128_t i128;typedef unsigned int uint;typedef unsigned long long ull;#define ALL(x) (x).begin(), (x).end()template <typename T> istream& operator>>(istream& is, vector<T>& v) {for (T& x : v) is >> x;return is;}template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {for (int i = 0; i < (int)v.size(); i++) {os << v[i] << (i + 1 == (int)v.size() ? "" : " ");}return os;}template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {os << '(' << p.first << ',' << p.second << ')';return os;}template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';return os;}template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';return os;}template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {os << '{';for (auto itr = m.begin(); itr != m.end();) {os << '(' << itr->first << ',' << itr->second << ')';if (++itr != m.end()) os << ',';}os << '}';return os;}template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {os << '{';for (auto itr = m.begin(); itr != m.end();) {os << '(' << itr->first << ',' << itr->second << ')';if (++itr != m.end()) os << ',';}os << '}';return os;}template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {os << '{';for (auto itr = s.begin(); itr != s.end();) {os << *itr;if (++itr != s.end()) os << ',';}os << '}';return os;}template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {os << '{';for (auto itr = s.begin(); itr != s.end();) {os << *itr;if (++itr != s.end()) os << ',';}os << '}';return os;}template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {os << '{';for (auto itr = s.begin(); itr != s.end();) {os << *itr;if (++itr != s.end()) os << ',';}os << '}';return os;}template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {for (int i = 0; i < (int)v.size(); i++) {os << v[i] << (i + 1 == (int)v.size() ? "" : " ");}return os;}void debug_out() { cerr << '\n'; }template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {cerr << head;if (sizeof...(Tail) > 0) cerr << ", ";debug_out(move(tail)...);}#ifdef LOCAL#define debug(...) \cerr << " "; \cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \cerr << " "; \debug_out(__VA_ARGS__)#else#define debug(...) 42#endiftemplate <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }template <class T1, class T2> inline bool chmin(T1& a, T2 b) {if (a > b) {a = b;return true;}return false;}template <class T1, class T2> inline bool chmax(T1& a, T2 b) {if (a < b) {a = b;return true;}return false;}#pragma endregion/*** @brief modint* @docs docs/modulo/modint.md*/template <uint32_t mod> class modint {using i64 = int64_t;using u32 = uint32_t;using u64 = uint64_t;public:u32 v;constexpr modint(const i64 x = 0) noexcept : v(x < 0 ? mod - 1 - (-(x + 1) % mod) : x % mod) {}constexpr u32& value() noexcept { return v; }constexpr const u32& value() const noexcept { return v; }constexpr modint operator+(const modint& rhs) const noexcept { return modint(*this) += rhs; }constexpr modint operator-(const modint& rhs) const noexcept { return modint(*this) -= rhs; }constexpr modint operator*(const modint& rhs) const noexcept { return modint(*this) *= rhs; }constexpr modint operator/(const modint& rhs) const noexcept { return modint(*this) /= rhs; }constexpr modint& operator+=(const modint& rhs) noexcept {v += rhs.v;if (v >= mod) v -= mod;return *this;}constexpr modint& operator-=(const modint& rhs) noexcept {if (v < rhs.v) v += mod;v -= rhs.v;return *this;}constexpr modint& operator*=(const modint& rhs) noexcept {v = (u64)v * rhs.v % mod;return *this;}constexpr modint& operator/=(const modint& rhs) noexcept { return *this *= rhs.pow(mod - 2); }constexpr modint pow(u64 exp) const noexcept {modint self(*this), res(1);while (exp > 0) {if (exp & 1) res *= self;self *= self;exp >>= 1;}return res;}constexpr modint& operator++() noexcept {if (++v == mod) v = 0;return *this;}constexpr modint& operator--() noexcept {if (v == 0) v = mod;return --v, *this;}constexpr modint operator++(int) noexcept {modint t = *this;return ++*this, t;}constexpr modint operator--(int) noexcept {modint t = *this;return --*this, t;}constexpr modint operator-() const noexcept { return modint(mod - v); }template <class T> friend constexpr modint operator+(T x, modint y) noexcept { return modint(x) + y; }template <class T> friend constexpr modint operator-(T x, modint y) noexcept { return modint(x) - y; }template <class T> friend constexpr modint operator*(T x, modint y) noexcept { return modint(x) * y; }template <class T> friend constexpr modint operator/(T x, modint y) noexcept { return modint(x) / y; }constexpr bool operator==(const modint& rhs) const noexcept { return v == rhs.v; }constexpr bool operator!=(const modint& rhs) const noexcept { return v != rhs.v; }constexpr bool operator!() const noexcept { return !v; }friend istream& operator>>(istream& s, modint& rhs) noexcept {i64 v;rhs = modint{(s >> v, v)};return s;}friend ostream& operator<<(ostream& s, const modint& rhs) noexcept { return s << rhs.v; }};/*** @brief BitMatrix* @docs docs/datastructure/BitMatrix.md*/template <size_t MAX_COL> struct BitMatrix {int n, m;vector<bitset<MAX_COL>> A;BitMatrix(int n) : n(n), m(MAX_COL), A(n) {}const bitset<MAX_COL>& operator[](int k) const { return A[k]; }bitset<MAX_COL>& operator[](int k) { return A[k]; }int gauss_jordan(int extended = 0) {int rank = 0;for (int j = 0; j < m - extended; j++) {int pivot = -1;for (int i = rank; i < n; i++) {if (A[i][j]) {pivot = i;break;}}if (pivot == -1) continue;swap(A[pivot], A[rank]);for (int i = 0; i < n; i++) {if (i != rank && A[i][j]) {A[i] ^= A[rank];}}rank++;}return rank;}pair<int, vector<int>> linear_equation(const vector<int>& b) {assert(n == (int)b.size());for (int i = 0; i < n; i++) A[i][m] = b[i];int rank = gauss_jordan(1);for (int i = rank; i < n; i++) {if (A[i][m]) {return {-1, vector<int>{}};}}vector<int> res(m, 0);for (int i = 0; i < rank; i++) res[i] = A[i][m];return {rank, res};}};const int INF = 1e9;const long long IINF = 1e18;const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};const char dir[4] = {'D', 'R', 'U', 'L'};const long long MOD = 1000000007;// const long long MOD = 998244353;const int MAX_LOG = 30, MAX_N = 305;using BM = BitMatrix<MAX_N>;using mint = modint<MOD>;int main() {cin.tie(0);ios::sync_with_stdio(false);int N, M, X;cin >> N >> M >> X;BM A(MAX_LOG + MAX_N);vector<int> b(MAX_LOG + MAX_N);for (int i = 0; i < MAX_LOG; i++, X >>= 1) b[i] = X & 1;for (int i = 0; i < N; i++) {int a;cin >> a;for (int j = 0; j < MAX_LOG; j++, a >>= 1) A[j][i] = a & 1;}for (int i = 0; i < M; i++) {int t, l, r;cin >> t >> l >> r;for (int j = --l; j < r; j++) A[MAX_LOG + i][j] = 1;b[MAX_LOG + i] = t;}int rank = A.linear_equation(b).first;if (rank == -1) {cout << 0 << '\n';return 0;}mint ans = mint(2).pow(N - rank);cout << ans << '\n';return 0;}