結果
問題 | No.183 たのしい排他的論理和(EASY) |
ユーザー | McGregorsh |
提出日時 | 2023-05-14 23:11:28 |
言語 | PyPy3 (7.3.15) |
結果 |
MLE
|
実行時間 | - |
コード長 | 1,610 bytes |
コンパイル時間 | 642 ms |
コンパイル使用メモリ | 87,188 KB |
実行使用メモリ | 729,148 KB |
最終ジャッジ日時 | 2023-08-20 08:15:41 |
合計ジャッジ時間 | 31,133 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 235 ms
92,564 KB |
testcase_01 | AC | 236 ms
92,216 KB |
testcase_02 | AC | 244 ms
92,676 KB |
testcase_03 | AC | 242 ms
92,404 KB |
testcase_04 | AC | 240 ms
92,680 KB |
testcase_05 | AC | 241 ms
92,724 KB |
testcase_06 | AC | 242 ms
92,240 KB |
testcase_07 | MLE | - |
testcase_08 | MLE | - |
testcase_09 | AC | 2,237 ms
478,916 KB |
testcase_10 | MLE | - |
testcase_11 | MLE | - |
testcase_12 | RE | - |
testcase_13 | AC | 237 ms
92,780 KB |
testcase_14 | MLE | - |
testcase_15 | MLE | - |
testcase_16 | AC | 239 ms
92,604 KB |
testcase_17 | AC | 766 ms
221,012 KB |
testcase_18 | MLE | - |
testcase_19 | AC | 484 ms
152,020 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() dp = [[False] * 16385 for i in range(N+1)] dp[0][0] = True for i in range(N): for j in range(16385): if dp[i][j]: dp[i+1][j ^ A[i]] = True dp[i+1][j] = True print(sum(dp[-1])) if __name__ == '__main__': main()