結果
問題 | No.1210 XOR Grid |
ユーザー |
|
提出日時 | 2020-08-30 15:51:56 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 258 ms / 2,000 ms |
コード長 | 4,160 bytes |
コンパイル時間 | 2,597 ms |
コンパイル使用メモリ | 199,676 KB |
最終ジャッジ日時 | 2025-01-13 23:07:55 |
ジャッジサーバーID (参考情報) |
judge2 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 57 |
ソースコード
//@formatter:off#include<bits/stdc++.h>#define rep(i,n) for (int i = 0; i < int(n); ++i)#define rrep(i,n) for (int i = int(n)-1; i >= 0; i--)#define rep2(i,s,n) for (int i = int(s); i < int(n); ++i)#define all(a) a.begin(),a.end()#define rall(a) a.rbegin(),a.rend()#define pb push_back#define eb emplace_back#define vi vector<int>#define vvi vector<vector<int>>#define vl vector<ll>#define vvl vector<vector<ll>>#define vd vector<double>#define vvd vector<vector<double>>#define vs vector<string>#define vc vector<char>#define vvc vector<vector<char>>#define vb vector<bool>#define vvb vector<vector<bool>>#define vp vector<P>#define vvp vector<vector<P>>using namespace std;using ll = long long;using P = pair<int,int>;using LP = pair<ll,ll>;template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?"":","); return os<<']';}void Yes(bool b) { cout << (b ? "Yes" : "No") << '\n'; }void YES(bool b) { cout << (b ? "YES" : "NO") << '\n'; }template<class T> bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}template<class T> bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}const int inf = 1001001001;const ll linf = 1001001001001001001;//@formatter:onconstexpr int mod = 1000000007;//constexpr int mod = 998244353;struct mint {ll x;mint(ll x = 0) : x((x % mod + mod) % mod) {}mint operator-() const { return mint(-x); }mint &operator+=(const mint &a) {if ((x += a.x) >= mod) x -= mod;return *this;}mint &operator++() { return *this += mint(1); }mint &operator-=(const mint &a) {if ((x += mod - a.x) >= mod) x -= mod;return *this;}mint &operator--() { return *this -= mint(1); }mint &operator*=(const mint &a) {(x *= a.x) %= mod;return *this;}mint operator+(const mint &a) const {mint res(*this);return res += a;}mint operator-(const mint &a) const {mint res(*this);return res -= a;}mint operator*(const mint &a) const {mint res(*this);return res *= a;}mint pow(ll t) const {mint res = mint(1), a(*this);while (t > 0) {if (t & 1) res *= a;t >>= 1;a *= a;}return res;}// for prime modmint inv() const { return pow(mod - 2); }mint &operator/=(const mint &a) { return *this *= a.inv(); }mint operator/(const mint &a) const {mint res(*this);return res /= a;}};ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }class combination {vector<mint> fact, ifact;public:combination(int n) : fact(n + 1), ifact(n + 1) {assert(n < mod);fact[0] = 1;for (int i = 1; i <= n; ++i) fact[i] = fact[i - 1] * i;ifact[n] = fact[n].inv();for (int i = n; i >= 1; --i) ifact[i - 1] = ifact[i] * i;}mint operator()(int n, int k) {if (k < 0 || k > n) return 0;return fact[n] * ifact[k] * ifact[n - k];}} comb(200010);int main() {ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);int n, m, x;cin >> n >> m >> x;vector<mint> v(2);rep(i, m + 1) {v[i & 1] += comb(m, i);}mint ans = 1;vl A(n), B(m);cin >> A >> B;rep(i, x) {vi a(n), b(m);rep(j, n) a[j] = A[j] >> i & 1;rep(j, m) b[j] = B[j] >> i & 1;int sa = accumulate(all(a), 0) & 1;int sb = accumulate(all(b), 0) & 1;if ((sa + sb) & 1) ans *= 0;rep(j, n - 1) ans *= v[a[j]];}cout << ans << endl;}