結果
問題 | No.2282 Boxed Nim |
ユーザー | McGregorsh |
提出日時 | 2023-04-28 21:29:48 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,675 bytes |
コンパイル時間 | 232 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 103,936 KB |
最終ジャッジ日時 | 2024-04-28 23:11:01 |
合計ジャッジ時間 | 4,934 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 161 ms
89,344 KB |
testcase_01 | AC | 170 ms
89,600 KB |
testcase_02 | AC | 165 ms
89,600 KB |
testcase_03 | AC | 166 ms
89,344 KB |
testcase_04 | WA | - |
testcase_05 | AC | 160 ms
89,472 KB |
testcase_06 | AC | 170 ms
89,472 KB |
testcase_07 | AC | 165 ms
89,728 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | AC | 191 ms
103,552 KB |
testcase_13 | AC | 187 ms
103,424 KB |
testcase_14 | WA | - |
testcase_15 | AC | 189 ms
101,504 KB |
testcase_16 | WA | - |
testcase_17 | AC | 189 ms
100,864 KB |
testcase_18 | WA | - |
testcase_19 | AC | 188 ms
103,808 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): N = int(input()) A = i_list() now = 0 p = 0 for i in range(N): now ^= A[i] if A[i] > 0: p += 1 if now == 0: if p % 2 == 0: print('Second') else: print('First') else: if p % 2 == 0: print('First') else: print('Second') if __name__ == '__main__': main()