結果
| 問題 | No.3090 NimNim | 
| コンテスト | |
| ユーザー |  | 
| 提出日時 | 2025-04-04 23:45:52 | 
| 言語 | PyPy3 (7.3.15) | 
| 結果 | 
                                WA
                                 
                             | 
| 実行時間 | - | 
| コード長 | 1,893 bytes | 
| コンパイル時間 | 832 ms | 
| コンパイル使用メモリ | 82,044 KB | 
| 実行使用メモリ | 99,824 KB | 
| 最終ジャッジ日時 | 2025-04-04 23:45:57 | 
| 合計ジャッジ時間 | 4,741 ms | 
| ジャッジサーバーID (参考情報) | judge1 / judge2 | 
(要ログイン)
| ファイルパターン | 結果 | 
|---|---|
| sample | WA * 2 | 
| other | AC * 18 WA * 8 | 
ソースコード
import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
from functools import lru_cache
def naive(A, B):
    @lru_cache(maxsize=None)
    def saiki(a, b):
        if all(x == 0 for x in a) and all(x == 0 for x in b):
            return False
        elif all(x == 0 for x in a):
            z = 1
            for i in range(len(b)):
                for x in range(b[i]):
                    z &= saiki(tuple(A), b[:i] + (x, ) + b[i+1:])
            return 1 ^ z
        else:
            z = 1
            for i in range(len(a)):
                for x in range(a[i]):
                    z &= saiki(a[:i]+(x, )+a[i+1:], b)
            return z ^1
    return saiki(tuple(A), tuple(B))
def solve(a, b):
    x = 0
    for i in range(len(a)):
        x ^= a[i]
    y = 0
    for i in range(len(b)):
        y ^= b[i]
    # print(x, y, all(i == 1 for i in a), len(a), a.count(1))
    if any(i > 1 for i in a):
        if x != 0:
            return 1
        else:
            return int(y > 0)
    else:
        if x == 0:
            return 1
        else:
            return 0
# from random import randint
# for _ in range(100000):
#     n = randint(1, 4) * 2 - 1
#     m = randint(1, 5)
#     a = [1 for i in range(n)]
#     b = [randint(0, 11) for i in range(m)]
#     z = 0
#     for i in range(m):
#         z ^= b[i]
#     b.append(z)
#     m += 1
#     x = solve(a, b)
#     y = naive(a, b)
#     print(n, m)
#     print(*a)
#     print(*b)
#     print(x, y)
#     assert x == y
# print(naive([1, 1, 1], [1, 2, 3]))
 
n, m = na()
a = na()
b = na()
print(["Second", "First"][solve(a, b)])
            
            
            
        