Submission #63800592


Source Code Expand

Copy
n = int(input())
a = list(map(int, input().split()))
suff = {}
for i in a:
suff.setdefault(i, 0)
suff[i] += 1
maxDistinct = 0
pref = {}
for i in range(1, n):
suff[a[i-1]] -= 1
pref.setdefault(a[i-1], 0)
pref[a[i-1]] += 1
if suff[a[i-1]] == 0:
del suff[a[i-1]]
currDistinct = len(pref.keys()) + len(suff.keys())
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
n = int(input())
a = list(map(int, input().split()))

suff = {}
for i in a:
    suff.setdefault(i, 0)
    suff[i] += 1

maxDistinct = 0

pref = {}
for i in range(1, n):
    suff[a[i-1]] -= 1
    pref.setdefault(a[i-1], 0)
    pref[a[i-1]] += 1

    if suff[a[i-1]] == 0:
        del suff[a[i-1]]
    
    currDistinct = len(pref.keys()) + len(suff.keys())
    
    
    if currDistinct > maxDistinct:
        maxDistinct = currDistinct

print(maxDistinct)

Submission Info

Submission Time
Task C - Variety Split Easy
User amit3396
Language Python (CPython 3.11.4)
Score 350
Code Size 482 Byte
Status AC
Exec Time 381 ms
Memory 54576 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 350 / 350
Status
AC × 2
AC × 38
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt
All 00_sample_00.txt, 00_sample_01.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt, 01_test_19.txt, 01_test_20.txt, 01_test_21.txt, 01_test_22.txt, 01_test_23.txt, 01_test_24.txt, 01_test_25.txt, 01_test_26.txt, 01_test_27.txt, 01_test_28.txt, 01_test_29.txt, 01_test_30.txt, 01_test_31.txt, 01_test_32.txt, 01_test_33.txt, 01_test_34.txt, 01_test_35.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 9 ms 8484 KB
00_sample_01.txt AC 10 ms 8500 KB
01_test_00.txt AC 10 ms 9012 KB
01_test_01.txt AC 10 ms 9096 KB
01_test_02.txt AC 9 ms 8548 KB
01_test_03.txt AC 10 ms 9040 KB
01_test_04.txt AC 10 ms 9004 KB
01_test_05.txt AC 97 ms 21848 KB
01_test_06.txt AC 361 ms 53736 KB
01_test_07.txt AC 122 ms 23104 KB
01_test_08.txt AC 381 ms 53396 KB
01_test_09.txt AC 301 ms 39768 KB
01_test_10.txt AC 381 ms 53728 KB
01_test_11.txt AC 95 ms 21272 KB
01_test_12.txt AC 377 ms 53436 KB
01_test_13.txt AC 55 ms 16384 KB
01_test_14.txt AC 375 ms 53664 KB
01_test_15.txt AC 346 ms 43444 KB
01_test_16.txt AC 356 ms 43392 KB
01_test_17.txt AC 371 ms 43656 KB
01_test_18.txt AC 367 ms 43532 KB
01_test_19.txt AC 362 ms 43360 KB
01_test_20.txt AC 219 ms 14344 KB
01_test_21.txt AC 275 ms 41664 KB
01_test_22.txt AC 255 ms 41632 KB
01_test_23.txt AC 257 ms 41716 KB
01_test_24.txt AC 261 ms 41624 KB
01_test_25.txt AC 280 ms 54492 KB
01_test_26.txt AC 309 ms 54576 KB
01_test_27.txt AC 9 ms 8512 KB
01_test_28.txt AC 10 ms 8632 KB
01_test_29.txt AC 292 ms 53584 KB
01_test_30.txt AC 268 ms 43424 KB
01_test_31.txt AC 272 ms 44876 KB
01_test_32.txt AC 277 ms 54568 KB
01_test_33.txt AC 274 ms 54536 KB
01_test_34.txt AC 272 ms 54324 KB
01_test_35.txt AC 278 ms 54468 KB


2025-04-21 (Mon)
07:33:42 +00:00