#544673 (C++17) No.1210 XOR Grid

提出ソース

結果

問題	No.1210 XOR Grid
ユーザー	FF256grhy
提出日時	2020-08-30 17:52:14
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	258 ms / 2,000 ms
コード長	6,817 bytes
コンパイル時間	2,149 ms
コンパイル使用メモリ	206,824 KB
実行使用メモリ	6,256 KB
最終ジャッジ日時	2023-08-09 17:56:33
合計ジャッジ時間	8,931 ms
ジャッジサーバーID （参考情報）	judge14 / judge11

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 4,380 KB
testcase_01	AC	2 ms 4,380 KB
testcase_02	AC	2 ms 4,380 KB
testcase_03	AC	1 ms 4,376 KB
testcase_04	AC	1 ms 4,376 KB
testcase_05	AC	2 ms 4,380 KB
testcase_06	AC	2 ms 4,380 KB
testcase_07	AC	1 ms 4,376 KB
testcase_08	AC	1 ms 4,380 KB
testcase_09	AC	1 ms 4,380 KB
testcase_10	AC	2 ms 4,376 KB
testcase_11	AC	1 ms 4,380 KB
testcase_12	AC	1 ms 4,380 KB
testcase_13	AC	1 ms 4,380 KB
testcase_14	AC	1 ms 4,380 KB
testcase_15	AC	1 ms 4,380 KB
testcase_16	AC	2 ms 4,376 KB
testcase_17	AC	2 ms 4,376 KB
testcase_18	AC	2 ms 4,376 KB
testcase_19	AC	2 ms 4,380 KB
testcase_20	AC	1 ms 4,376 KB
testcase_21	AC	1 ms 4,380 KB
testcase_22	AC	2 ms 4,376 KB
testcase_23	AC	1 ms 4,376 KB
testcase_24	AC	1 ms 4,380 KB
testcase_25	AC	128 ms 4,840 KB
testcase_26	AC	122 ms 4,576 KB
testcase_27	AC	124 ms 4,684 KB
testcase_28	AC	124 ms 4,556 KB
testcase_29	AC	119 ms 4,624 KB
testcase_30	AC	93 ms 4,380 KB
testcase_31	AC	123 ms 4,552 KB
testcase_32	AC	121 ms 4,624 KB
testcase_33	AC	2 ms 4,380 KB
testcase_34	AC	2 ms 4,380 KB
testcase_35	AC	1 ms 4,380 KB
testcase_36	AC	37 ms 4,620 KB
testcase_37	AC	35 ms 4,668 KB
testcase_38	AC	37 ms 4,820 KB
testcase_39	AC	31 ms 4,668 KB
testcase_40	AC	70 ms 6,136 KB
testcase_41	AC	72 ms 6,208 KB
testcase_42	AC	255 ms 6,084 KB
testcase_43	AC	216 ms 6,148 KB
testcase_44	AC	252 ms 6,144 KB
testcase_45	AC	258 ms 6,220 KB
testcase_46	AC	254 ms 6,252 KB
testcase_47	AC	57 ms 6,088 KB
testcase_48	AC	55 ms 6,132 KB
testcase_49	AC	2 ms 4,376 KB
testcase_50	AC	117 ms 6,256 KB
testcase_51	AC	233 ms 6,252 KB
testcase_52	AC	194 ms 5,992 KB
testcase_53	AC	237 ms 6,136 KB
testcase_54	AC	55 ms 6,088 KB
testcase_55	AC	138 ms 6,084 KB
testcase_56	AC	125 ms 4,496 KB
testcase_57	AC	120 ms 5,476 KB
testcase_58	AC	1 ms 4,380 KB
testcase_59	AC	2 ms 4,376 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using LL = long long int;
#define incII(i, l, r) for(LL i = (l)    ; i <= (r); i++)
#define incID(i, l, r) for(LL i = (l)    ; i <  (r); i++)
#define incCI(i, l, r) for(LL i = (l) + 1; i <= (r); i++)
#define incCD(i, l, r) for(LL i = (l) + 1; i <  (r); i++)
#define decII(i, l, r) for(LL i = (r)    ; i >= (l); i--)
#define decID(i, l, r) for(LL i = (r) - 1; i >= (l); i--)
#define decCI(i, l, r) for(LL i = (r)    ; i >  (l); i--)
#define decCD(i, l, r) for(LL i = (r) - 1; i >  (l); i--)
#define inc(i, n)  incID(i, 0, n)
#define dec(i, n)  decID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec1(i, n) decII(i, 1, n)
auto inII = [](auto v, auto l, auto r) { return (l <= v && v <= r); };
auto inID = [](auto v, auto l, auto r) { return (l <= v && v <  r); };
auto inCI = [](auto v, auto l, auto r) { return (l <  v && v <= r); };
auto inCD = [](auto v, auto l, auto r) { return (l <  v && v <  r); };
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define FI first
#define SE second
#define FR front()
#define BA back()
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
auto setmin   = [](auto & a, auto b) { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };
#define SC static_cast
#define SI(v) SC<int>(v.size())
#define SL(v) SC<LL >(v.size())
#define RF(e, v) for(auto & e: v)
#define until(e) while(! (e))
#define if_not(e) if(! (e))
#define ef else if
#define UR assert(false)
#define CT continue
#define RV(v) reverse(ALL(v))
auto * IS = & cin;
// input elements (as a tuple)
template<typename U, int I> void in_([[maybe_unused]] U & t) { }
template<typename U, int I, typename A, typename ... B> void in_(U & t) { (* IS) >> get<I>(t); in_<U, I + 1, B ...>(t); }
template<typename ... T> auto in() { tuple<T ...> t; in_<tuple<T ...>, 0, T ...>(t); return t; }
// input an array
template<typename T, int N> auto ain() { array<T, N> a; inc(i, N) { (* IS) >> a[i]; } return a; }
// input a (multi-dimensional) vector
template<typename T> T vin() { T v; (* IS) >> v; return v; }
template<typename T, typename N, typename ... M> auto vin(N n, M ... m) {
	vector<decltype(vin<T, M ...>(m ...))> v(n); inc(i, n) { v[i] = vin<T, M ...>(m ...); } return v;
}
// input multi-column (as a tuple of vector)
template<typename U, int I> void colin_([[maybe_unused]] U & t) { }
template<typename U, int I, typename A, typename ... B> void colin_(U & t) {
	A a; (* IS) >> a; get<I>(t).push_back(a); colin_<U, I + 1, B ...>(t);
}
template<typename ... T> auto colin(int n) {
	tuple<vector<T> ...> t; inc(i, n) { colin_<tuple<vector<T> ...>, 0, T ...>(t); } return t;
}
auto * OS = & cout;
// output elements
void out_([[maybe_unused]] string s) { }
template<typename A> void out_([[maybe_unused]] string s, A && a) { (* OS) << a; }
template<typename A, typename ... B> void out_(string s, A && a, B && ... b) { (* OS) << a << s; out_(s, b ...); }
auto outF = [](auto x, auto y, auto z, auto ... a) { (* OS) << x; out_(y, a ...); (* OS) << z << flush; };
auto out  = [](auto ... a) { outF("", " " , "\n", a ...); };
auto outS = [](auto ... a) { outF("", " " , " " , a ...); };
auto outL = [](auto ... a) { outF("", "\n", "\n", a ...); };
auto outN = [](auto ... a) { outF("", ""  , ""  , a ...); };
array<string, 3> SEQ_FMT = { "", " ", "" };
auto & SEQ_BEG = SEQ_FMT[0];
auto & SEQ_MID = SEQ_FMT[1];
auto & SEQ_END = SEQ_FMT[2];
// output a (multi-dimensional) vector
template<typename T> ostream & operator<<(ostream & os, vector<T> const & v) {
	os << SEQ_BEG; inc(i, SI(v)) { os << (i == 0 ? "" : SEQ_MID) << v[i]; } return (os << SEQ_END);
}
template<typename T> void vout_(T && v) { (* OS) << v; }
template<typename T, typename A, typename ... B> void vout_(T && v, A a, B ... b) {
	inc(i, SI(v)) { (* OS) << (i == 0 ? "" : a); vout_(v[i], b ...); }
}
template<typename T, typename A, typename ... B> void vout(T && v, A a, B ... b) {
	vout_(v, b ...); (* OS) << a << flush;
}

// ---- ----

template<LL M> class ModInt {
private:
	LL v;
	pair<LL, LL> ext_gcd(LL a, LL b) {
		if(b == 0) { assert(a == 1); return { 1, 0 }; }
		auto p = ext_gcd(b, a % b);
		return { p.SE, p.FI - (a / b) * p.SE };
	}
public:
	ModInt(LL vv = 0) { v = vv; if(abs(v) >= M) { v %= M; } if(v < 0) { v += M; } }
	LL get_v() { return v; }
	ModInt inv() { return ext_gcd(M, v).SE; }
	ModInt exp(LL b) {
		ModInt p = 1, a = v; if(b < 0) { a = a.inv(); b = -b; }
		while(b) { if(b & 1) { p *= a; } a *= a; b >>= 1; }
		return p;
	}
	friend bool      operator< (ModInt    a, ModInt   b) { return (a.v <  b.v); }
	friend bool      operator> (ModInt    a, ModInt   b) { return (a.v >  b.v); }
	friend bool      operator<=(ModInt    a, ModInt   b) { return (a.v <= b.v); }
	friend bool      operator>=(ModInt    a, ModInt   b) { return (a.v >= b.v); }
	friend bool      operator==(ModInt    a, ModInt   b) { return (a.v == b.v); }
	friend bool      operator!=(ModInt    a, ModInt   b) { return (a.v != b.v); }
	friend ModInt    operator+ (ModInt    a            ) { return ModInt(+a.v); }
	friend ModInt    operator- (ModInt    a            ) { return ModInt(-a.v); }
	friend ModInt    operator+ (ModInt    a, ModInt   b) { return ModInt(a.v + b.v); }
	friend ModInt    operator- (ModInt    a, ModInt   b) { return ModInt(a.v - b.v); }
	friend ModInt    operator* (ModInt    a, ModInt   b) { return ModInt(a.v * b.v); }
	friend ModInt    operator/ (ModInt    a, ModInt   b) { return a * b.inv(); }
	friend ModInt    operator^ (ModInt    a, LL       b) { return a.exp(b); }
	friend ModInt  & operator+=(ModInt  & a, ModInt   b) { return (a = a + b); }
	friend ModInt  & operator-=(ModInt  & a, ModInt   b) { return (a = a - b); }
	friend ModInt  & operator*=(ModInt  & a, ModInt   b) { return (a = a * b); }
	friend ModInt  & operator/=(ModInt  & a, ModInt   b) { return (a = a / b); }
	friend ModInt  & operator^=(ModInt  & a, LL       b) { return (a = a ^ b); }
	friend istream & operator>>(istream & s, ModInt & b) { s >> b.v; b = ModInt(b.v); return s; }
	friend ostream & operator<<(ostream & s, ModInt   b) { return (s << b.v); }
};

// ----

using MI = ModInt<1'000'000'007>;

#define bit(b, i) (((b) >> (i)) & 1)
#define PC __builtin_popcountll
#define BL(a) (a ? 64 - __builtin_clzll(a) : 0)

int main() {
	auto [h, w, x] = in<LL, LL, int>();
	auto a = vin<LL>(h);
	auto b = vin<LL>(w);
	MI ans = 1;
	inc(k, x) {
		LL sa = 0, sb = 0;
		RF(e, a) { sa += bit(e, k); }
		RF(e, b) { sb += bit(e, k); }
		if(sa % 2 != sb % 2) { ans = 0; break; }
		ans *= MI(2) ^ ((h - 1) * (w - 1));
	}
	out(ans);
}

yukicoder

結果

テストケース

ソースコード