結果
問題 | No.2044 Infinite Nim |
ユーザー | McGregorsh |
提出日時 | 2022-08-19 23:14:48 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,567 bytes |
コンパイル時間 | 344 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 103,936 KB |
最終ジャッジ日時 | 2024-04-17 01:52:41 |
合計ジャッジ時間 | 9,392 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 197 ms
89,472 KB |
testcase_01 | AC | 196 ms
89,600 KB |
testcase_02 | AC | 192 ms
89,344 KB |
testcase_03 | WA | - |
testcase_04 | AC | 187 ms
89,600 KB |
testcase_05 | AC | 180 ms
89,472 KB |
testcase_06 | AC | 186 ms
89,472 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 176 ms
89,344 KB |
testcase_10 | AC | 170 ms
88,960 KB |
testcase_11 | AC | 182 ms
89,344 KB |
testcase_12 | AC | 179 ms
89,472 KB |
testcase_13 | AC | 204 ms
95,104 KB |
testcase_14 | AC | 193 ms
91,264 KB |
testcase_15 | WA | - |
testcase_16 | AC | 199 ms
91,264 KB |
testcase_17 | AC | 202 ms
97,024 KB |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | AC | 187 ms
94,592 KB |
testcase_21 | WA | - |
testcase_22 | AC | 190 ms
95,872 KB |
testcase_23 | AC | 186 ms
92,672 KB |
testcase_24 | AC | 201 ms
97,792 KB |
testcase_25 | AC | 188 ms
92,032 KB |
testcase_26 | AC | 203 ms
96,640 KB |
testcase_27 | AC | 185 ms
91,776 KB |
testcase_28 | AC | 200 ms
102,784 KB |
testcase_29 | AC | 183 ms
93,952 KB |
testcase_30 | AC | 195 ms
98,688 KB |
testcase_31 | AC | 198 ms
103,040 KB |
testcase_32 | AC | 199 ms
103,040 KB |
testcase_33 | AC | 196 ms
103,168 KB |
testcase_34 | AC | 197 ms
101,760 KB |
testcase_35 | AC | 203 ms
103,936 KB |
testcase_36 | AC | 181 ms
88,960 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() num = 0 for i in range(n): if A[i] == -1: num += 1 if num % 2 == 1: print('First') else: print('Second') if __name__ == '__main__': main()