Submission #65253214


Source Code Expand

Copy
from collections import Counter
N,D=map(int,input().split())
A=list(map(int,input().split()))
count=Counter(A)
keys=sorted(count.keys())
ans=0
for x in keys:
while count[x]>0:
ans+=1
count[x]-=1
if count[x+D]>0:
count[x+D]-=1
print(min(ans,N-ans))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
from collections import Counter
N,D=map(int,input().split())
A=list(map(int,input().split()))

count=Counter(A)
keys=sorted(count.keys())
ans=0

for x in keys:
    while count[x]>0:
        ans+=1
        count[x]-=1
        if count[x+D]>0:
            count[x+D]-=1

print(min(ans,N-ans))

Submission Info

Submission Time
Task D - Forbidden Difference
User kotafuku
Language Python (PyPy 3.10-v7.3.12)
Score 0
Code Size 307 Byte
Status WA
Exec Time 183 ms
Memory 138860 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 425
Status
AC × 3
AC × 35
WA × 5
Set Name Test Cases
Sample 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt
All 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 01_random_10.txt, 01_random_11.txt, 01_random_12.txt, 01_random_13.txt, 01_random_14.txt, 01_random_15.txt, 01_random_16.txt, 01_random_17.txt, 01_random_18.txt, 01_random_19.txt, 01_random_20.txt, 01_random_21.txt, 01_random_22.txt, 01_random_23.txt, 01_random_24.txt, 01_random_25.txt, 01_random_26.txt, 01_random_27.txt, 01_random_28.txt, 01_random_29.txt, 01_random_30.txt, 01_random_31.txt, 01_random_32.txt, 02_handmade_01.txt, 02_handmade_02.txt, 02_handmade_03.txt, 02_handmade_04.txt, 02_handmade_05.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 71 ms 76856 KiB
00_sample_02.txt AC 70 ms 76808 KiB
00_sample_03.txt AC 70 ms 77188 KiB
01_random_01.txt AC 107 ms 104512 KiB
01_random_02.txt AC 77 ms 81708 KiB
01_random_03.txt AC 107 ms 104628 KiB
01_random_04.txt AC 86 ms 91100 KiB
01_random_05.txt AC 107 ms 104632 KiB
01_random_06.txt AC 102 ms 101880 KiB
01_random_07.txt WA 104 ms 104784 KiB
01_random_08.txt AC 93 ms 96988 KiB
01_random_09.txt AC 105 ms 105068 KiB
01_random_10.txt AC 103 ms 102160 KiB
01_random_11.txt AC 109 ms 104632 KiB
01_random_12.txt AC 97 ms 99964 KiB
01_random_13.txt AC 108 ms 104976 KiB
01_random_14.txt AC 90 ms 93856 KiB
01_random_15.txt WA 103 ms 104704 KiB
01_random_16.txt AC 83 ms 89000 KiB
01_random_17.txt AC 112 ms 106564 KiB
01_random_18.txt AC 105 ms 100472 KiB
01_random_19.txt AC 112 ms 106348 KiB
01_random_20.txt AC 99 ms 99740 KiB
01_random_21.txt AC 114 ms 106928 KiB
01_random_22.txt AC 114 ms 106752 KiB
01_random_23.txt WA 112 ms 106324 KiB
01_random_24.txt AC 95 ms 98040 KiB
01_random_25.txt AC 183 ms 138860 KiB
01_random_26.txt AC 95 ms 92156 KiB
01_random_27.txt AC 181 ms 138632 KiB
01_random_28.txt AC 98 ms 93356 KiB
01_random_29.txt AC 175 ms 138748 KiB
01_random_30.txt AC 168 ms 129992 KiB
01_random_31.txt WA 178 ms 138776 KiB
01_random_32.txt AC 104 ms 92924 KiB
02_handmade_01.txt AC 105 ms 108500 KiB
02_handmade_02.txt WA 103 ms 108436 KiB
02_handmade_03.txt AC 70 ms 76972 KiB
02_handmade_04.txt AC 70 ms 77036 KiB
02_handmade_05.txt AC 71 ms 77036 KiB


2025-06-30 (Mon)
12:06:56 +09:00