結果
問題 | No.1456 Range Xor |
ユーザー | McGregorsh |
提出日時 | 2023-05-12 13:03:57 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 193 ms / 2,000 ms |
コード長 | 1,620 bytes |
コンパイル時間 | 370 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 124,544 KB |
最終ジャッジ日時 | 2024-05-06 05:19:42 |
合計ジャッジ時間 | 11,288 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 144 ms
89,472 KB |
testcase_01 | AC | 146 ms
89,216 KB |
testcase_02 | AC | 152 ms
89,344 KB |
testcase_03 | AC | 183 ms
124,416 KB |
testcase_04 | AC | 190 ms
124,288 KB |
testcase_05 | AC | 193 ms
124,544 KB |
testcase_06 | AC | 190 ms
124,416 KB |
testcase_07 | AC | 190 ms
124,288 KB |
testcase_08 | AC | 193 ms
124,288 KB |
testcase_09 | AC | 189 ms
124,160 KB |
testcase_10 | AC | 189 ms
124,160 KB |
testcase_11 | AC | 153 ms
91,520 KB |
testcase_12 | AC | 147 ms
89,984 KB |
testcase_13 | AC | 157 ms
96,512 KB |
testcase_14 | AC | 155 ms
96,640 KB |
testcase_15 | AC | 178 ms
119,296 KB |
testcase_16 | AC | 181 ms
116,352 KB |
testcase_17 | AC | 163 ms
101,504 KB |
testcase_18 | AC | 153 ms
96,384 KB |
testcase_19 | AC | 174 ms
110,080 KB |
testcase_20 | AC | 191 ms
116,224 KB |
testcase_21 | AC | 186 ms
109,440 KB |
testcase_22 | AC | 180 ms
110,080 KB |
testcase_23 | AC | 164 ms
97,664 KB |
testcase_24 | AC | 158 ms
89,984 KB |
testcase_25 | AC | 158 ms
95,104 KB |
testcase_26 | AC | 172 ms
104,576 KB |
testcase_27 | AC | 179 ms
112,384 KB |
testcase_28 | AC | 148 ms
93,568 KB |
testcase_29 | AC | 184 ms
120,192 KB |
testcase_30 | AC | 183 ms
124,160 KB |
testcase_31 | AC | 150 ms
92,544 KB |
testcase_32 | AC | 155 ms
91,904 KB |
testcase_33 | AC | 161 ms
99,712 KB |
testcase_34 | AC | 187 ms
123,392 KB |
testcase_35 | AC | 171 ms
104,448 KB |
testcase_36 | AC | 186 ms
124,288 KB |
testcase_37 | AC | 191 ms
119,936 KB |
testcase_38 | AC | 154 ms
90,112 KB |
testcase_39 | AC | 176 ms
113,152 KB |
testcase_40 | AC | 176 ms
113,024 KB |
testcase_41 | AC | 157 ms
90,368 KB |
testcase_42 | AC | 162 ms
89,984 KB |
testcase_43 | AC | 153 ms
89,600 KB |
testcase_44 | AC | 144 ms
89,472 KB |
testcase_45 | AC | 141 ms
89,472 KB |
testcase_46 | AC | 146 ms
89,472 KB |
testcase_47 | AC | 145 ms
89,600 KB |
testcase_48 | AC | 144 ms
89,600 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, K = i_map() A = i_list() AA = [0] for i in range(N): a = A[i] ^ AA[-1] AA.append(a) C = Counter(AA) for i in range(N): p = K ^ AA[i] if C[p] > 0: print('Yes') exit() C[AA[i]] -= 1 print('No') if __name__ == '__main__': main()