結果
問題 | No.183 たのしい排他的論理和(EASY) |
ユーザー | McGregorsh |
提出日時 | 2023-05-14 23:13:10 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 1,614 bytes |
コンパイル時間 | 264 ms |
コンパイル使用メモリ | 82,316 KB |
実行使用メモリ | 96,692 KB |
最終ジャッジ日時 | 2024-05-07 15:29:31 |
合計ジャッジ時間 | 11,637 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 135 ms
89,408 KB |
testcase_01 | AC | 132 ms
89,180 KB |
testcase_02 | AC | 130 ms
89,828 KB |
testcase_03 | AC | 139 ms
89,624 KB |
testcase_04 | AC | 129 ms
89,568 KB |
testcase_05 | AC | 130 ms
89,684 KB |
testcase_06 | AC | 127 ms
89,640 KB |
testcase_07 | RE | - |
testcase_08 | AC | 1,317 ms
95,836 KB |
testcase_09 | AC | 908 ms
93,604 KB |
testcase_10 | AC | 1,099 ms
94,528 KB |
testcase_11 | AC | 1,400 ms
96,188 KB |
testcase_12 | RE | - |
testcase_13 | AC | 128 ms
89,596 KB |
testcase_14 | AC | 756 ms
96,692 KB |
testcase_15 | AC | 1,430 ms
96,388 KB |
testcase_16 | AC | 130 ms
89,688 KB |
testcase_17 | AC | 418 ms
90,524 KB |
testcase_18 | RE | - |
testcase_19 | AC | 272 ms
90,396 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 dp[0] = True for i in range(N): ndp = [False] * 16385 for j in range(16385): if dp[j]: ndp[j ^ A[i]] = True ndp[j] = True dp = ndp print(sum(dp)) if __name__ == '__main__': main()