結果
問題 | No.1072 A Nice XOR Pair |
ユーザー | McGregorsh |
提出日時 | 2023-05-18 00:23:47 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 401 ms / 2,000 ms |
コード長 | 1,534 bytes |
コンパイル時間 | 254 ms |
コンパイル使用メモリ | 87,172 KB |
実行使用メモリ | 127,000 KB |
最終ジャッジ日時 | 2023-08-22 01:38:32 |
合計ジャッジ時間 | 5,208 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 233 ms
92,568 KB |
testcase_01 | AC | 234 ms
92,292 KB |
testcase_02 | AC | 230 ms
92,620 KB |
testcase_03 | AC | 225 ms
92,388 KB |
testcase_04 | AC | 225 ms
92,548 KB |
testcase_05 | AC | 229 ms
92,268 KB |
testcase_06 | AC | 246 ms
93,968 KB |
testcase_07 | AC | 401 ms
127,000 KB |
testcase_08 | AC | 328 ms
95,732 KB |
testcase_09 | AC | 324 ms
95,864 KB |
testcase_10 | AC | 333 ms
95,784 KB |
testcase_11 | AC | 376 ms
107,200 KB |
testcase_12 | AC | 382 ms
123,304 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, X = i_map() A = [int(input()) for i in range(N)] CA = Counter(A) ans = 0 for i in range(N): CA[A[i]] -= 1 p = A[i] ^ X ans += CA[p] print(ans) if __name__ == '__main__': main()