結果
問題 | No.1210 XOR Grid |
ユーザー | suta28407928 |
提出日時 | 2020-08-30 14:11:56 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 252 ms / 2,000 ms |
コード長 | 3,343 bytes |
コンパイル時間 | 936 ms |
コンパイル使用メモリ | 100,084 KB |
実行使用メモリ | 6,472 KB |
最終ジャッジ日時 | 2023-08-09 12:18:50 |
合計ジャッジ時間 | 7,962 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,384 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,376 KB |
testcase_06 | AC | 1 ms
4,376 KB |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 1 ms
4,376 KB |
testcase_09 | AC | 1 ms
4,376 KB |
testcase_10 | AC | 2 ms
4,376 KB |
testcase_11 | AC | 1 ms
4,380 KB |
testcase_12 | AC | 2 ms
4,380 KB |
testcase_13 | AC | 1 ms
4,380 KB |
testcase_14 | AC | 1 ms
4,376 KB |
testcase_15 | AC | 2 ms
4,376 KB |
testcase_16 | AC | 1 ms
4,376 KB |
testcase_17 | AC | 1 ms
4,376 KB |
testcase_18 | AC | 2 ms
4,380 KB |
testcase_19 | AC | 2 ms
4,376 KB |
testcase_20 | AC | 1 ms
4,380 KB |
testcase_21 | AC | 1 ms
4,380 KB |
testcase_22 | AC | 1 ms
4,380 KB |
testcase_23 | AC | 1 ms
4,380 KB |
testcase_24 | AC | 1 ms
4,376 KB |
testcase_25 | AC | 126 ms
4,568 KB |
testcase_26 | AC | 123 ms
4,628 KB |
testcase_27 | AC | 124 ms
4,720 KB |
testcase_28 | AC | 125 ms
4,876 KB |
testcase_29 | AC | 124 ms
4,568 KB |
testcase_30 | AC | 96 ms
4,392 KB |
testcase_31 | AC | 124 ms
4,608 KB |
testcase_32 | AC | 125 ms
4,608 KB |
testcase_33 | AC | 2 ms
4,380 KB |
testcase_34 | AC | 2 ms
4,376 KB |
testcase_35 | AC | 1 ms
4,380 KB |
testcase_36 | AC | 29 ms
4,908 KB |
testcase_37 | AC | 31 ms
4,568 KB |
testcase_38 | AC | 30 ms
4,736 KB |
testcase_39 | AC | 28 ms
4,732 KB |
testcase_40 | AC | 59 ms
6,260 KB |
testcase_41 | AC | 58 ms
6,320 KB |
testcase_42 | AC | 252 ms
6,456 KB |
testcase_43 | AC | 213 ms
6,472 KB |
testcase_44 | AC | 251 ms
6,152 KB |
testcase_45 | AC | 252 ms
6,316 KB |
testcase_46 | AC | 242 ms
6,192 KB |
testcase_47 | AC | 58 ms
6,232 KB |
testcase_48 | AC | 59 ms
6,304 KB |
testcase_49 | AC | 1 ms
4,376 KB |
testcase_50 | AC | 113 ms
6,192 KB |
testcase_51 | AC | 243 ms
6,316 KB |
testcase_52 | AC | 208 ms
6,060 KB |
testcase_53 | AC | 239 ms
6,240 KB |
testcase_54 | AC | 59 ms
6,152 KB |
testcase_55 | AC | 150 ms
6,192 KB |
testcase_56 | AC | 128 ms
4,564 KB |
testcase_57 | AC | 127 ms
5,400 KB |
testcase_58 | AC | 2 ms
4,380 KB |
testcase_59 | AC | 1 ms
4,380 KB |
ソースコード
#include <iostream> #include <string> #include <cstdlib> #include <cmath> #include <vector> #include <unordered_map> #include <map> #include <set> #include <algorithm> #include <queue> #include <stack> #include <functional> #include <bitset> #include <assert.h> #include <unordered_map> #include <fstream> #include <ctime> #include <complex> using namespace std; typedef long long ll; typedef vector<ll> vl; typedef vector<vl> vvl; typedef vector<char> vc; typedef vector<string> vs; typedef vector<bool> vb; typedef vector<double> vd; typedef pair<ll,ll> P; typedef pair<int,int> pii; typedef vector<P> vpl; typedef tuple<ll,ll,ll> tapu; #define rep(i,n) for(int i=0; i<(n); i++) #define REP(i,a,b) for(int i=(a); i<(b); i++) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() const int inf = 1<<30; const ll linf = 1LL<<62; const int MAX = 1020000; ll dy[8] = {1,-1,0,0,1,-1,1,-1}; ll dx[8] = {0,0,1,-1,1,-1,-1,1}; const double pi = acos(-1); const double eps = 1e-7; template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){ if(a>b){ a = b; return true; } else return false; } template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){ if(a<b){ a = b; return true; } else return false; } template<typename T> inline void print(T &a){ rep(i,a.size()) cout << a[i] << " "; cout << "\n"; } template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";} template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){ cout << a << " " << b << " " << c << "\n"; } ll pcount(ll x) {return __builtin_popcountll(x);} const int mod = 1e9 + 7; //const int mod = 998244353; template <std::uint_fast64_t Modulus> class modint { using u64 = std::uint_fast64_t; public: u64 a; constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {} constexpr u64 &value() noexcept { return a; } constexpr const u64 &value() const noexcept { return a; } 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 { a += rhs.a; if (a >= Modulus) { a -= Modulus; } return *this; } constexpr modint &operator-=(const modint rhs) noexcept { if (a < rhs.a) { a += Modulus; } a -= rhs.a; return *this; } constexpr modint &operator*=(const modint rhs) noexcept { a = a * rhs.a % Modulus; return *this; } constexpr modint &operator/=(modint rhs) noexcept { u64 exp = Modulus - 2; while (exp) { if (exp % 2) { *this *= rhs; } rhs *= rhs; exp /= 2; } return *this; } }; using mint = modint<mod>; ll modpow(ll x, ll n, ll mod){ ll res = 1; while(n > 0){ if(n & 1) res = res * x % mod; x = x * x % mod; n >>= 1; } return res; } int main(){ ll n,m,x; cin >> n >> m >> x; ll exor = 0; vl a(n); rep(i,n) cin >> a[i], exor ^= a[i]; vl b(m); rep(i,m) cin >> b[i], exor ^= b[i]; if(exor != 0) cout << 0 << "\n"; else{ ll ans = modpow(modpow(2,x,mod),(n-1)*(m-1),mod); cout << ans << "\n"; } }