Submission #23626141

Source Code Expand

N = int(input())
A = list(map(int, input().split()))

lim = N // 2
m = {}

for i in range(lim):
  if A[i] == A[N-i-1]:
    continue
  else:
    m[A[i]] = True
    m[A[N-i-1]] = True


ans = len(m.items())

if ans == 0:
  print(0)
else:
  print(ans - 1)

Submission Info

Submission Time
Task D - KAIBUNsyo
User Tommy3
Language Python (3.8.2)
Score 0
Code Size 271 Byte
Status WA
Exec Time 133 ms
Memory 33640 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 3
AC × 12
WA × 19
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt
Case Name Status Exec Time Memory
sample_01.txt AC 20 ms 8888 KiB
sample_02.txt AC 22 ms 9056 KiB
sample_03.txt AC 25 ms 8880 KiB
test_01.txt AC 19 ms 8892 KiB
test_02.txt WA 19 ms 9180 KiB
test_03.txt WA 27 ms 8900 KiB
test_04.txt WA 19 ms 8920 KiB
test_05.txt AC 18 ms 8996 KiB
test_06.txt AC 19 ms 9004 KiB
test_07.txt WA 122 ms 29140 KiB
test_08.txt WA 123 ms 30796 KiB
test_09.txt WA 41 ms 12880 KiB
test_10.txt WA 104 ms 25588 KiB
test_11.txt WA 66 ms 18816 KiB
test_12.txt WA 21 ms 9552 KiB
test_13.txt WA 60 ms 16456 KiB
test_14.txt WA 85 ms 21840 KiB
test_15.txt AC 110 ms 31396 KiB
test_16.txt WA 132 ms 32220 KiB
test_17.txt WA 110 ms 32036 KiB
test_18.txt WA 111 ms 32040 KiB
test_19.txt WA 128 ms 31536 KiB
test_20.txt WA 127 ms 31592 KiB
test_21.txt WA 131 ms 31736 KiB
test_22.txt WA 133 ms 31536 KiB
test_23.txt WA 122 ms 33640 KiB
test_24.txt AC 113 ms 31428 KiB
test_25.txt AC 86 ms 32040 KiB
test_26.txt AC 85 ms 31436 KiB
test_27.txt AC 119 ms 32036 KiB
test_28.txt AC 119 ms 32040 KiB