結果
問題 | No.1072 A Nice XOR Pair |
ユーザー | McGregorsh |
提出日時 | 2022-07-09 09:08:01 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,753 bytes |
コンパイル時間 | 243 ms |
コンパイル使用メモリ | 86,688 KB |
実行使用メモリ | 132,588 KB |
最終ジャッジ日時 | 2023-08-28 19:22:25 |
合計ジャッジ時間 | 5,388 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 232 ms
92,316 KB |
testcase_01 | AC | 227 ms
92,436 KB |
testcase_02 | AC | 225 ms
92,292 KB |
testcase_03 | AC | 224 ms
92,352 KB |
testcase_04 | WA | - |
testcase_05 | AC | 225 ms
92,300 KB |
testcase_06 | AC | 252 ms
93,744 KB |
testcase_07 | AC | 436 ms
132,588 KB |
testcase_08 | AC | 334 ms
100,936 KB |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | AC | 392 ms
116,052 KB |
testcase_12 | AC | 402 ms
126,008 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: ans += count_a[A[i]] * count_a[point] count_a[A[i]] = 0 count_a[point] = 0 print(ans) if __name__ == '__main__': main()