結果
問題 | No.183 たのしい排他的論理和(EASY) |
ユーザー | McGregorsh |
提出日時 | 2023-05-14 23:13:10 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 1,614 bytes |
コンパイル時間 | 968 ms |
コンパイル使用メモリ | 87,132 KB |
実行使用メモリ | 100,668 KB |
最終ジャッジ日時 | 2023-08-20 08:16:53 |
合計ジャッジ時間 | 14,735 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 241 ms
92,412 KB |
testcase_01 | AC | 237 ms
92,644 KB |
testcase_02 | AC | 240 ms
92,888 KB |
testcase_03 | AC | 239 ms
92,624 KB |
testcase_04 | AC | 237 ms
92,416 KB |
testcase_05 | AC | 244 ms
92,908 KB |
testcase_06 | AC | 234 ms
92,460 KB |
testcase_07 | RE | - |
testcase_08 | AC | 1,572 ms
99,624 KB |
testcase_09 | AC | 1,159 ms
97,852 KB |
testcase_10 | AC | 1,352 ms
98,608 KB |
testcase_11 | AC | 1,702 ms
100,140 KB |
testcase_12 | RE | - |
testcase_13 | AC | 236 ms
92,668 KB |
testcase_14 | AC | 940 ms
100,520 KB |
testcase_15 | AC | 1,754 ms
100,668 KB |
testcase_16 | AC | 243 ms
92,808 KB |
testcase_17 | AC | 570 ms
95,256 KB |
testcase_18 | RE | - |
testcase_19 | AC | 406 ms
93,824 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()