結果
問題 | No.1210 XOR Grid |
ユーザー | 👑 hos.lyric |
提出日時 | 2020-08-30 13:56:22 |
言語 | D (dmd 2.107.1) |
結果 |
AC
|
実行時間 | 127 ms / 2,000 ms |
コード長 | 3,501 bytes |
コンパイル時間 | 2,630 ms |
コンパイル使用メモリ | 151,572 KB |
実行使用メモリ | 26,228 KB |
最終ジャッジ日時 | 2023-09-04 09:38:49 |
合計ジャッジ時間 | 8,793 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 2 ms
4,376 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 1 ms
4,376 KB |
testcase_06 | AC | 1 ms
4,376 KB |
testcase_07 | AC | 1 ms
4,380 KB |
testcase_08 | AC | 1 ms
4,380 KB |
testcase_09 | AC | 2 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,376 KB |
testcase_14 | AC | 2 ms
4,376 KB |
testcase_15 | AC | 1 ms
4,380 KB |
testcase_16 | AC | 2 ms
4,376 KB |
testcase_17 | AC | 1 ms
4,376 KB |
testcase_18 | AC | 2 ms
4,380 KB |
testcase_19 | AC | 1 ms
4,376 KB |
testcase_20 | AC | 1 ms
4,376 KB |
testcase_21 | AC | 1 ms
4,380 KB |
testcase_22 | AC | 1 ms
4,380 KB |
testcase_23 | AC | 1 ms
4,376 KB |
testcase_24 | AC | 2 ms
4,376 KB |
testcase_25 | AC | 64 ms
13,900 KB |
testcase_26 | AC | 63 ms
11,848 KB |
testcase_27 | AC | 63 ms
11,788 KB |
testcase_28 | AC | 62 ms
14,412 KB |
testcase_29 | AC | 63 ms
14,448 KB |
testcase_30 | AC | 51 ms
12,708 KB |
testcase_31 | AC | 63 ms
13,812 KB |
testcase_32 | AC | 62 ms
13,384 KB |
testcase_33 | AC | 1 ms
4,376 KB |
testcase_34 | AC | 1 ms
4,376 KB |
testcase_35 | AC | 1 ms
4,376 KB |
testcase_36 | AC | 19 ms
10,696 KB |
testcase_37 | AC | 19 ms
10,516 KB |
testcase_38 | AC | 19 ms
10,976 KB |
testcase_39 | AC | 17 ms
10,304 KB |
testcase_40 | AC | 36 ms
18,732 KB |
testcase_41 | AC | 35 ms
18,860 KB |
testcase_42 | AC | 126 ms
26,228 KB |
testcase_43 | AC | 112 ms
21,808 KB |
testcase_44 | AC | 127 ms
24,516 KB |
testcase_45 | AC | 125 ms
25,080 KB |
testcase_46 | AC | 122 ms
25,108 KB |
testcase_47 | AC | 37 ms
18,252 KB |
testcase_48 | AC | 35 ms
18,040 KB |
testcase_49 | AC | 2 ms
4,376 KB |
testcase_50 | AC | 60 ms
18,620 KB |
testcase_51 | AC | 124 ms
25,468 KB |
testcase_52 | AC | 105 ms
23,664 KB |
testcase_53 | AC | 125 ms
23,800 KB |
testcase_54 | AC | 36 ms
18,236 KB |
testcase_55 | AC | 75 ms
21,492 KB |
testcase_56 | AC | 63 ms
12,100 KB |
testcase_57 | AC | 69 ms
17,736 KB |
testcase_58 | AC | 1 ms
4,380 KB |
testcase_59 | AC | 2 ms
4,376 KB |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } struct ModInt(int M_) { import std.conv : to; alias M = M_; int x; this(ModInt a) { x = a.x; } this(long a) { x = cast(int)(a % M); if (x < 0) x += M; } ref ModInt opAssign(long a) { return (this = ModInt(a)); } ref ModInt opOpAssign(string op)(ModInt a) { static if (op == "+") { x += a.x; if (x >= M) x -= M; } else static if (op == "-") { x -= a.x; if (x < 0) x += M; } else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); } else static if (op == "/") { this *= a.inv(); } else static assert(false); return this; } ref ModInt opOpAssign(string op)(long a) { static if (op == "^^") { if (a < 0) return (this = inv()^^(-a)); ModInt t2 = this, te = ModInt(1); for (long e = a; e > 0; e >>= 1) { if (e & 1) te *= t2; t2 *= t2; } x = cast(int)(te.x); return this; } else return mixin("this " ~ op ~ "= ModInt(a)"); } ModInt inv() const { int a = x, b = M, y = 1, z = 0, t; for (; ; ) { t = a / b; a -= t * b; if (a == 0) { assert(b == 1 || b == -1); return ModInt(b * z); } y -= t * z; t = b / a; b -= t * a; if (b == 0) { assert(a == 1 || a == -1); return ModInt(a * y); } z -= t * y; } } ModInt opUnary(string op: "-")() const { return ModInt(-x); } ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); } ModInt opBinaryRight(string op)(long a) const { return mixin("ModInt(a) " ~ op ~ "= this"); } bool opCast(T: bool)() const { return (x != 0); } string toString() const { return x.to!string; } } enum MO = 10^^9 + 7; alias Mint = ModInt!MO; void main() { try { for (; ; ) { const M = readInt(); const N = readInt(); const X = readInt(); auto A = new long[M]; foreach (i; 0 .. M) { A[i] = readLong(); } auto B = new long[N]; foreach (j; 0 .. N) { B[j] = readLong(); } long sumA, sumB; foreach (i; 0 .. M) { sumA ^= A[i]; } foreach (j; 0 .. N) { sumB ^= B[j]; } Mint ans; if (sumA == sumB) { ans = ((Mint(2)^^(M - 1))^^(N - 1))^^X; } writeln(ans); } } catch (EOFException e) { } }