結果
問題 | No.1072 A Nice XOR Pair |
ユーザー | McGregorsh |
提出日時 | 2022-07-09 13:02:28 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 1,839 bytes |
コンパイル時間 | 822 ms |
コンパイル使用メモリ | 86,988 KB |
実行使用メモリ | 132,516 KB |
最終ジャッジ日時 | 2023-08-29 00:18:03 |
合計ジャッジ時間 | 6,105 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 226 ms
92,288 KB |
testcase_01 | AC | 225 ms
92,300 KB |
testcase_02 | AC | 228 ms
92,440 KB |
testcase_03 | AC | 227 ms
92,552 KB |
testcase_04 | RE | - |
testcase_05 | AC | 225 ms
92,444 KB |
testcase_06 | AC | 257 ms
93,880 KB |
testcase_07 | AC | 451 ms
132,516 KB |
testcase_08 | AC | 338 ms
100,864 KB |
testcase_09 | RE | - |
testcase_10 | RE | - |
testcase_11 | AC | 408 ms
115,964 KB |
testcase_12 | AC | 426 ms
126,268 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 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 = [] nums = set() count_a = defaultdict(int) for i in range(n): num = int(input()) nums.add(num) A.append(num) count_a[num] += 1 ans = 0 for i in range(n): point = A[i] ^ x if point in nums: if point == A[i]: ans += nCr(count_a[A[i]], 2) else: ans += count_a[A[i]] * count_a[point] count_a[A[i]] = 0 count_a[point] = 0 print(ans) if __name__ == '__main__': main()