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

• 問題: No.803 Very Limited Xor Subset
• ユーザー: heno239
• 提出日時: 2019-03-14 22:50:18
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 15 ms / 2,000 ms
• コード長: 5,492 bytes
• コンパイル時間: 1,064 ms
• コンパイル使用メモリ: 121,616 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-07 17:40:53
• 合計ジャッジ時間: 2,682 ms
• ジャッジサーバーID （参考情報）: judge5 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	1 ms; 5,376 KB
testcase_10	AC	1 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	1 ms; 5,376 KB
testcase_13	AC	1 ms; 5,376 KB
testcase_14	AC	11 ms; 5,376 KB
testcase_15	AC	12 ms; 5,376 KB
testcase_16	AC	12 ms; 5,376 KB
testcase_17	AC	11 ms; 5,376 KB
testcase_18	AC	11 ms; 5,376 KB
testcase_19	AC	11 ms; 5,376 KB
testcase_20	AC	12 ms; 5,376 KB
testcase_21	AC	11 ms; 5,376 KB
testcase_22	AC	12 ms; 5,376 KB
testcase_23	AC	15 ms; 5,376 KB
testcase_24	AC	13 ms; 5,376 KB
testcase_25	AC	14 ms; 5,376 KB
testcase_26	AC	14 ms; 5,376 KB
testcase_27	AC	13 ms; 5,376 KB
testcase_28	AC	13 ms; 5,376 KB
testcase_29	AC	13 ms; 5,376 KB
testcase_30	AC	13 ms; 5,376 KB
testcase_31	AC	15 ms; 5,376 KB
testcase_32	AC	14 ms; 5,376 KB
testcase_33	AC	14 ms; 5,376 KB
testcase_34	AC	2 ms; 5,376 KB
testcase_35	AC	11 ms; 5,376 KB
testcase_36	AC	6 ms; 5,376 KB
testcase_37	AC	8 ms; 5,376 KB
testcase_38	AC	2 ms; 5,376 KB
testcase_39	AC	1 ms; 5,376 KB
testcase_40	AC	12 ms; 5,376 KB
testcase_41	AC	12 ms; 5,376 KB
testcase_42	AC	12 ms; 5,376 KB
testcase_43	AC	11 ms; 5,376 KB
testcase_44	AC	1 ms; 5,376 KB
testcase_45	AC	1 ms; 5,376 KB
testcase_46	AC	2 ms; 5,376 KB

ソースコード

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
typedef long double ld;
const ll INF = mod * mod;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;



typedef vector<int> vec;
typedef pair<vec, int> vect;
typedef vector<vect> mat;

bool uwaaaaaaaaaaa[300][300];
bool exi[300];
//bit.ver
//rankを返す
int Gaussian_elimination(mat &A,bool b) {
	fill(exi, exi + 300, false);
	int n = A.size(); 
	if (n == 0)return 0;
	int m = A[0].first.size();
	int le = 0;
	rep(j, m) {
		Rep(i, le, n) {
			if (A[i].first[j]) {
				swap(A[le], A[i]);
				rep(i2, n) {
					if (i2 == le)continue;
					if (A[i2].first[j]) {
						if (b) {
							rep(i3, n) {
								if (uwaaaaaaaaaaa[A[le].second][i3]) {
									uwaaaaaaaaaaa[A[i2].second][i3] ^= 1;
								}
							}
						}
						//uwaaaaaaaaaaa[A[i2].second][A[le].second] ^= 1;
						rep(k, m) {
							A[i2].first[k] ^= A[le].first[k];
						}
					}
				}
				exi[j] = true;
				le++; break;
			}
		}
	}
	return le;
}
int n, m, x;
mat A,B;
bool use[300];
struct zyoken {
	int t, l, r;
};
zyoken z[300];

int mem[300];
void solve() {
	cin >> n >> m >> x;
	A.resize(n);
	rep(i, n) {
		A[i].first.resize(30);
		int a; cin >> a; mem[i] = a;
		rep(j, 30) {
			if (a&(1 << j)) {
				A[i].first[j] = 1;
			}
		}
		A[i].second = i;
		/*cout << i << " ";
		rep(j, 30) {
			cout << A[i].first[j];
		}
		cout << endl;*/
	}
	rep(i, n) {
		uwaaaaaaaaaaa[i][i] ^= 1;
	}
	int r=Gaussian_elimination(A,true);
	/*rep(i, n) {
		rep(j, n) {
			cout << uwaaaaaaaaaaa[i][j];
		}
		cout << endl;
	}*/
	/*cout << r << "hello?" << endl;
	rep(i, n) {
		cout << A[i].second << " ";
		rep(j, 30) {
			cout << A[i].first[j];
		}
		cout << endl;
	}*/
	//debug
	/*rep(i, n) {
		rep(j, 30) {
			cout << A[i].first[j];
		}
		cout << endl;
	}
*/
	int s = 0;
	rep(i, r) {
		bool f = false;
		rep(j, 30) {
			if (!exi[j])continue;
			if (A[i].first[j] && (x&(1 << j))) {
				f = true;
				rep(i3, n) {
					if (uwaaaaaaaaaaa[A[i].second][i3]) {
						use[i3] ^= 1;
					}
				}
				break;
				//use[A[i].second] = true;
			}
		}
		if (f) {
			rep(j, 30) {
				if (A[i].first[j]) {
					s ^= (1 << j);
				}
			}
		}
	}
	rep(i, m) {
		int typ, le, ri; cin >> typ >> le >> ri;
		le--; ri--;
		z[i] = { typ,le,ri };
	}
	//cout << s << endl;
	if (s != x) {
		cout << 0 << endl;
		//cout << "hieizannennryakuzikonnryuu" << endl;
		return;
	}
	B.resize(n-r);
	bitset<300> b = 0;
	rep(i, m) {
		int num = 0;
		Rep1(j, z[i].l, z[i].r) {
			if (use[j])num ^= 1;
		}
		//cout << num << endl;
		if (num)b[i] = 1;
	}
	/*cout << "nanns" << endl;
	rep(j, m) {
		cout << b[j];
	}
	cout << endl;*/
	rep(j, m) {
		if (z[j].t)b[j] = b[j]^1;
	}
	Rep(i, r, n) {
		B[i - r].first.resize(m);
		rep(j, n) {
			if (uwaaaaaaaaaaa[A[i].second][j]) {
				use[j] ^= 1;
			}
		}
		//use[A[i].second] = 1;
		//int xu = mem[A[i].second];

		//rep(j, r) {
		//	rep(k, 30) {
		//		if (A[j].first[k] && (xu&(1 << k))) {
		//			int id = A[j].second;
		//			rep(i3, n) {
		//				if (uwaaaaaaaaaaa[id][i3]) {
		//					use[i3] ^= 1;
		//				}
		//			}
		//			break;
		//			//use[A[j].second] = true;
		//		}
		//	}
		//}
		rep(j, m) {
			int num = 0;
			Rep1(k, z[j].l, z[j].r) {
				if (use[k])num ^= 1;
			}
			if (num)B[i - r].first[j] = 1;
		}
		/*cout << "hello!!! I am "<<A[i].second<< endl;
		rep(j, n) {
			cout << use[j];
		}
		cout << endl;*/
	}
	//cout << n - r << endl;
	//cout << "hellooooooeveryyyyoneeeee" << endl;
	/*rep(i, n - r) {
		rep(j, m) {
			cout << B[i].first[j];
		}
		cout << endl;
	}
	cout << "finished" << endl;*/
	int rn=Gaussian_elimination(B,false);
	fill(use, use + rn, false);
	//bが存在してるか判定
	bitset<300> b_=0;
	rep(i, rn) {
		rep(j, m) {
			if (!exi[j])continue;
			if (b[j] && B[i].first[j])use[i] = true;
		}
		if (use[i]) {
			rep(j, m) {
				b_[j] = b_[j]^B[i].first[j];
			}
		}
	}
	//cout << n - r << endl;
	/*rep(i, n-r) {
		rep(j,m){
			cout << B[i].first[j];
		}
		cout << endl;
	}*/
	/*rep(i, m) {
		cout << b[i];
	}
	cout << endl;
	rep(i, m) {
		cout << b_[i];
	}
	cout << endl;*/
	if (b != b_) {
		cout << 0 << endl;
		return;
	}
	ll ans = 1;
	int d = n - r - rn;
	rep(i, d) {
		ans = ans * 2 % mod;
	}
	cout << ans << endl;
}

void check() {
	int n, m, x; cin >> n >> m >> x;
	vector<int> a(n);
	rep(i, n) {
		cin >> a[i];
	}
	rep(i, m) {
		cin >> z[i].t >> z[i].l >> z[i].r;
		z[i].l--; z[i].r--;
	}
	int cnt = 0;
	rep(i, (1 << n)) {
		int u[20] = {};
		int s = 0;
		rep(j, n) {
			if (i&(1 << j)) {
				s ^= a[j];
				u[j] = 1;
			}
		}
		if (s == x) {
			bool f = true;
			rep(j, m) {
				int num = 0;
				Rep1(k, z[j].l, z[j].r) {
					if (i&(1 << k))num ^= 1;
				}
				if (num^z[j].t)f = false;
			}
			if(f)cnt++;
		}
	}
	cout << cnt << endl;
}
int main() {
	solve();
	//check();
	//stop
	return 0;
}