Submission #65249790


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(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(N-ans)

Submission Info

Submission Time
Task D - Forbidden Difference
User kotafuku
Language Python (PyPy 3.10-v7.3.12)
Score 0
Code Size 298 Byte
Status WA
Exec Time 176 ms
Memory 139212 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 70 ms 76908 KiB
00_sample_02.txt AC 70 ms 76728 KiB
00_sample_03.txt AC 70 ms 76792 KiB
01_random_01.txt AC 105 ms 104728 KiB
01_random_02.txt AC 77 ms 81976 KiB
01_random_03.txt AC 104 ms 104668 KiB
01_random_04.txt AC 87 ms 91296 KiB
01_random_05.txt AC 104 ms 104544 KiB
01_random_06.txt AC 101 ms 101808 KiB
01_random_07.txt WA 100 ms 104864 KiB
01_random_08.txt AC 91 ms 97016 KiB
01_random_09.txt AC 104 ms 104596 KiB
01_random_10.txt AC 101 ms 102148 KiB
01_random_11.txt AC 106 ms 104612 KiB
01_random_12.txt AC 98 ms 99676 KiB
01_random_13.txt AC 105 ms 104612 KiB
01_random_14.txt AC 88 ms 94052 KiB
01_random_15.txt WA 102 ms 104492 KiB
01_random_16.txt AC 84 ms 89092 KiB
01_random_17.txt AC 113 ms 106908 KiB
01_random_18.txt AC 105 ms 100644 KiB
01_random_19.txt AC 112 ms 106536 KiB
01_random_20.txt AC 99 ms 99672 KiB
01_random_21.txt AC 113 ms 106960 KiB
01_random_22.txt AC 111 ms 106788 KiB
01_random_23.txt WA 110 ms 106472 KiB
01_random_24.txt AC 99 ms 97964 KiB
01_random_25.txt AC 176 ms 138384 KiB
01_random_26.txt AC 91 ms 92708 KiB
01_random_27.txt AC 170 ms 139212 KiB
01_random_28.txt AC 93 ms 92920 KiB
01_random_29.txt AC 169 ms 138336 KiB
01_random_30.txt AC 168 ms 129872 KiB
01_random_31.txt WA 169 ms 138868 KiB
01_random_32.txt AC 98 ms 93156 KiB
02_handmade_01.txt AC 101 ms 108320 KiB
02_handmade_02.txt WA 102 ms 108536 KiB
02_handmade_03.txt AC 69 ms 76856 KiB
02_handmade_04.txt AC 69 ms 76932 KiB
02_handmade_05.txt AC 69 ms 76872 KiB


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