結果
問題 | No.1852 Divide or Reduce |
ユーザー | 👑 hos.lyric |
提出日時 | 2022-02-25 22:33:29 |
言語 | D (dmd 2.106.1) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,045 bytes |
コンパイル時間 | 709 ms |
コンパイル使用メモリ | 106,696 KB |
実行使用メモリ | 22,832 KB |
最終ジャッジ日時 | 2023-09-04 16:10:16 |
合計ジャッジ時間 | 6,095 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | AC | 94 ms
15,832 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | AC | 95 ms
16,692 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | AC | 320 ms
21,560 KB |
testcase_17 | AC | 323 ms
22,084 KB |
testcase_18 | AC | 323 ms
21,620 KB |
testcase_19 | AC | 259 ms
22,832 KB |
testcase_20 | AC | 328 ms
22,428 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)); } void main() { debug {{ bool[string] cache; bool calc(int[] as) { const key = as.to!string; auto ptr = key in cache; if (ptr) return *ptr; bool ret; const asLen = cast(int)(as.length); foreach (i; 0 .. asLen) if (as[i] >= 2) { foreach (x; 1 .. as[i] / 2 + 1) { auto bs = as.dup; bs[i] = x; bs ~= as[i] - x; bs.sort; if (!calc(bs)) { ret = true; break; } } } if (!ret) { bool ok = true; foreach (i; 0 .. asLen) { ok = ok && (as[i] >= 2); } if (ok) { auto bs = as.dup; bs[] -= 1; if (!calc(bs)) { ret = true; } } } return cache[key] = ret; } enum lim = 8 + 1; foreach (a; 1 .. lim) { writeln(a, ": ", calc([a])); } foreach (a; 1 .. lim) foreach (b; a .. lim) { writeln([a, b], ": ", calc([a, b])); } foreach (a; 1 .. lim) foreach (b; a .. lim) foreach (c; b .. lim) { writeln([a, b, c], ": ", calc([a, b, c])); } foreach (a; 1 .. lim) foreach (b; a .. lim) foreach (c; b .. lim) foreach (d; c .. lim) { // writeln([a, b, c, d], ": ", calc([a, b, c, d])); if (!calc([a, b, c, d])) { writeln([a, b, c, d]); } } }} try { for (; ; ) { const numCases = readInt; foreach (caseId; 0 .. numCases) { const N = readInt; auto A = new long[N]; foreach (i; 0 .. N) { A[i] = readLong; } int cnt; foreach (i; 0 .. N) { if (A[i] % 2 == 0) { ++cnt; } } const ans = (cnt == N || cnt % 2 != 0); writeln(ans ? "First" : "Second"); } } } catch (EOFException e) { } }