結果
問題 | No.183 たのしい排他的論理和(EASY) |
ユーザー | McGregorsh |
提出日時 | 2023-05-14 23:15:23 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 4,120 ms / 5,000 ms |
コード長 | 1,613 bytes |
コンパイル時間 | 287 ms |
コンパイル使用メモリ | 86,988 KB |
実行使用メモリ | 261,068 KB |
最終ジャッジ日時 | 2023-08-20 08:19:01 |
合計ジャッジ時間 | 30,813 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 239 ms
93,316 KB |
testcase_01 | AC | 241 ms
93,844 KB |
testcase_02 | AC | 249 ms
95,824 KB |
testcase_03 | AC | 245 ms
95,560 KB |
testcase_04 | AC | 238 ms
93,244 KB |
testcase_05 | AC | 247 ms
96,332 KB |
testcase_06 | AC | 242 ms
94,060 KB |
testcase_07 | AC | 4,120 ms
260,584 KB |
testcase_08 | AC | 3,173 ms
261,068 KB |
testcase_09 | AC | 2,272 ms
260,892 KB |
testcase_10 | AC | 2,696 ms
260,924 KB |
testcase_11 | AC | 3,420 ms
261,060 KB |
testcase_12 | AC | 247 ms
96,568 KB |
testcase_13 | AC | 237 ms
92,648 KB |
testcase_14 | AC | 2,280 ms
260,960 KB |
testcase_15 | AC | 3,518 ms
260,960 KB |
testcase_16 | AC | 245 ms
95,260 KB |
testcase_17 | AC | 1,041 ms
260,880 KB |
testcase_18 | AC | 3,640 ms
260,844 KB |
testcase_19 | AC | 669 ms
231,992 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] * 33000 dp[0] = True for i in range(N): ndp = [False] * 33000 for j in range(33000): if dp[j]: ndp[j ^ A[i]] = True ndp[j] = True dp = ndp print(sum(dp)) if __name__ == '__main__': main()