# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1214499 | Ahmed_Solyman | XOR Sum (info1cup17_xorsum) | Pypy 3 | 296 ms | 186016 KiB |
import sys
from collections import defaultdict
def solve():
input = sys.stdin.read().split()
ptr = 0
N = int(input[ptr])
ptr += 1
V = list(map(int, input[ptr:ptr+N]))
freq = defaultdict(int)
for num in V:
freq[num] += 1
S = [num for num in freq if freq[num] % 2 == 1]
S.sort()
result = 0
len_S = len(S)
for i in range(len_S):
x = S[i]
cnt = freq[x]
pairs = cnt * (cnt + 1) // 2
if pairs % 2 == 1:
result ^= (x + x)
for j in range(i + 1, len_S):
y = S[j]
result ^= (x + y)
print(result)
solve()
Compilation message (stdout)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |