結果
| 問題 | No.803 Very Limited Xor Subset |
| ユーザー |
 apricity
|
| 提出日時 | 2023-03-14 19:51:25 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 3 ms / 2,000 ms |
| コード長 | 6,496 bytes |
| コンパイル時間 | 1,447 ms |
| コンパイル使用メモリ | 130,160 KB |
| 最終ジャッジ日時 | 2025-02-11 11:16:31 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 43 |
ソースコード
#include<iostream>#include<string>#include<vector>#include<algorithm>#include<numeric>#include<cmath>#include<utility>#include<tuple>#include<cstdint>#include<cstdio>#include<iomanip>#include<map>#include<queue>#include<set>#include<stack>#include<deque>#include<unordered_map>#include<unordered_set>#include<bitset>#include<cctype>#include<chrono>#include<random>#include<cassert>#include<cstddef>#include<iterator>#include<string_view>#include<type_traits>#ifdef LOCAL# include "debug_print.hpp"# define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)#else# define debug(...) (static_cast<void>(0))#endifusing namespace std;#define rep(i,n) for(int i=0; i<(n); i++)#define rrep(i,n) for(int i=(n)-1; i>=0; i--)#define FOR(i,a,b) for(int i=(a); i<(b); i++)#define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--)#define ALL(v) v.begin(), v.end()#define RALL(v) v.rbegin(), v.rend()#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );#define pb push_backusing ll = long long;using D = double;using LD = long double;using P = pair<int, int>;template<typename T> using PQ = priority_queue<T,vector<T>>;template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}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>istream &operator>>(istream &is, pair<T, U> &p) {is >> p.first >> p.second;return is;}template<typename T>ostream &operator<<(ostream &os, const vector<T> &v) {int s = (int)v.size();for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];return os;}template<typename T>istream &operator>>(istream &is, vector<T> &v) {for (auto &x : v) is >> x;return is;}void in() {}template<typename T, class... U>void in(T &t, U &...u) {cin >> t;in(u...);}void out() { cout << "\n"; }template<typename T, class... U, char sep = ' '>void out(const T &t, const U &...u) {cout << t;if (sizeof...(u)) cout << sep;out(u...);}void outr() {}template<typename T, class... U, char sep = ' '>void outr(const T &t, const U &...u) {cout << t;outr(u...);}const int MAX_ROW = 333; // to be set appropriatelyconst int MAX_COL = 333; // to be set appropriatelystruct BitMatrix {int H, W;bitset<MAX_COL> val[MAX_ROW];BitMatrix(int m = 1, int n = 1) : H(m), W(n) {}inline bitset<MAX_COL>& operator [] (int i) {return val[i];}};int GaussJordan(BitMatrix &A, bool is_extended = false) {int rank = 0;for (int col = 0; col < A.W; ++col) {if (is_extended && col == A.W - 1) break;int pivot = -1;for (int row = rank; row < A.H; ++row) {if (A[row][col]) {pivot = row;break;}}if (pivot == -1) continue;swap(A[pivot], A[rank]);for (int row = 0; row < A.H; ++row) {if (row != rank && A[row][col]) A[row] ^= A[rank];}++rank;}return rank;}int linear_equation(BitMatrix A, vector<int> b, vector<int> &res) {int m = A.H, n = A.W;BitMatrix M(m, n + 1);for (int i = 0; i < m; ++i) {for (int j = 0; j < n; ++j) M[i][j] = A[i][j];M[i][n] = b[i];}int rank = GaussJordan(M, true);// check if it has no solutionfor (int row = rank; row < m; ++row) if (M[row][n]) return -1;// answerres.assign(n, 0);for (int i = 0; i < rank; ++i) res[i] = M[i][n];return rank;}template<int mod> struct Fp {long long val;constexpr Fp(long long v = 0) noexcept : val(v % mod) {if (val < 0) val += mod;}constexpr int getmod() { return mod; }constexpr Fp operator - () const noexcept {return val ? mod - val : 0;}constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }constexpr Fp& operator += (const Fp& r) noexcept {val += r.val;if (val >= mod) val -= mod;return *this;}constexpr Fp& operator -= (const Fp& r) noexcept {val -= r.val;if (val < 0) val += mod;return *this;}constexpr Fp& operator *= (const Fp& r) noexcept {val = val * r.val % mod;return *this;}constexpr Fp& operator /= (const Fp& r) noexcept {long long a = r.val, b = mod, u = 1, v = 0;while (b) {long long t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}val = val * u % mod;if (val < 0) val += mod;return *this;}constexpr bool operator == (const Fp& r) const noexcept {return this->val == r.val;}constexpr bool operator != (const Fp& r) const noexcept {return this->val != r.val;}friend constexpr istream& operator >> (istream &is, const Fp<mod>& x) noexcept {int val; is >> val;x = Fp<mod>(val);return is;}friend constexpr ostream& operator << (ostream &os, const Fp<mod>& x) noexcept {return os << x.val;}friend constexpr Fp<mod> modpow(const Fp<mod> &a, long long n) noexcept {if (n == 0) return 1;auto t = modpow(a, n / 2);t = t * t;if (n & 1) t = t * a;return t;}};const int mod = 1e9+7;// const int mod = 998244353;using mint = Fp<mod>;int main(){ios_base::sync_with_stdio(false);cin.tie(nullptr);int n,m,x; in(n,m,x);vector<int> a(n); in(a);BitMatrix b(m+30,n);vector<int> c(m+30),res;rep(i,n)rep(j,30) b[j][i] = (a[i] >> j) & 1;rep(i,m){int t,l,r; in(t,l,r); l--;FOR(j,l,r) b[i+30][j] = 1;c[i+30] = t;}rep(i,30) c[i] = (x >> i) & 1;int r = linear_equation(b,c,res);if(r == -1) out(0);else{mint ans = 1;rep(i,n-r) ans *= 2;out(ans);}}