結果

問題 No.1210 XOR Grid
ユーザー carrot46
提出日時 2020-08-30 14:01:53
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 321 ms / 2,000 ms
コード長 3,007 bytes
コンパイル時間 1,909 ms
コンパイル使用メモリ 172,168 KB
実行使用メモリ 8,064 KB
最終ジャッジ日時 2024-11-15 07:12:49
合計ジャッジ時間 10,318 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 57
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll N,M,H,W,Q,K,A,B;
string S;
typedef pair<ll, ll> P;
const ll INF = (1LL<<58);
template <unsigned long long mod > class modint{
public:
ll x;
constexpr modint(){x = 0;}
constexpr modint(ll _x) : x((_x < 0 ? ((_x += (LLONG_MAX / mod) * mod) < 0 ? _x + (LLONG_MAX / mod) * mod : _x) : _x)%mod){}
constexpr modint operator-(){
return x == 0 ? 0 : mod - x;
}
constexpr modint& operator+=(const modint& a){
if((x += a.x) >= mod) x -= mod;
return *this;
}
constexpr modint operator+(const modint& a) const{
return modint(*this) += a;
}
constexpr modint& operator-=(const modint& a){
if((x -= a.x) < 0) x += mod;
return *this;
}
constexpr modint operator-(const modint& a) const{
return modint(*this) -= a;
}
constexpr modint& operator*=(const modint& a){
(x *= a.x)%=mod;
return *this;
}
constexpr modint operator*(const modint& a) const{
return modint(*this) *= a;
}
constexpr modint pow(unsigned long long pw) const{
modint res(1), comp(*this);
while(pw){
if(pw&1) res *= comp;
comp *= comp;
pw >>= 1;
}
return res;
}
//mod
constexpr modint inv() const{
return modint(*this).pow(mod - 2);
}
constexpr modint& operator/=(const modint &a){
(x *= a.inv().x)%=mod;
return *this;
}
constexpr modint operator/(const modint &a) const{
return modint(*this) /= a;
}
};
#define mod1 998244353
#define mod2 1000000007
using mint = modint<mod2>;
ostream& operator<<(ostream& os, const mint& a){
os << a.x;
return os;
}
using vm = vector<mint>;
const ll MAX_N = ll(2e+5) + 10;
vm fact(MAX_N, mint(1)), fact_inv(MAX_N, mint(1)), n_inv(MAX_N, mint(1));
void makefact(){
reps(i,2,MAX_N) {
fact[i] = fact[i-1] * mint(i);
n_inv[i] = mint(i).inv();
fact_inv[i] = fact_inv[i-1] * n_inv[i];
}
}
mint nCm(ll n, ll m){
return fact[n] * fact_inv[n-m] * fact_inv[m];
}
mint nCm_inv(ll n, ll m){
return fact[n-m] * fact[m] * fact_inv[n];
}
int main() {
makefact();
cin>>N>>M>>K;
vec num(K, 0);
rep(i,N){
cin>>A;
rep(j, K) num[j] += (A>>j)&1;
}
rep(i, M){
cin>>B;
rep(j, K) num[j] += (B>>j)&1;
}
rep(i, K){
if(num[i] & 1){
cout<<0<<endl;
return 0;
}
}
mint res(0);
for(int n = 0; n <= N; n += 2) res += nCm(N, n);
cout<<res.pow(K * (M - 1))<<endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0