Submission #1189727


Source Code Expand

n=int(input())
a=[int(i) for i in input().split()]
a.sort()
b=[a[0]]
k=1
for i in range(1,n):
 if i==k:
  if a[i]!=b[-1]:
   b.append(a[i])
   k=i+1
  else:
   k=i+2
print(len(b))

Submission Info

Submission Time
Task D - Card Eater
User tacloth
Language Python (3.4.3)
Score 0
Code Size 191 Byte
Status WA
Exec Time 96 ms
Memory 13880 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 2
AC × 12
WA × 5
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt
All 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt
Case Name Status Exec Time Memory
00_example_01.txt AC 17 ms 3060 KB
00_example_02.txt AC 17 ms 3064 KB
01.txt AC 17 ms 2940 KB
02.txt WA 20 ms 3700 KB
03.txt AC 17 ms 3064 KB
04.txt WA 17 ms 3060 KB
05.txt AC 17 ms 3064 KB
06.txt AC 81 ms 13876 KB
07.txt AC 80 ms 13852 KB
08.txt WA 94 ms 13812 KB
09.txt WA 80 ms 13512 KB
10.txt AC 76 ms 13836 KB
11.txt WA 96 ms 13880 KB
12.txt AC 81 ms 13848 KB
13.txt AC 94 ms 13880 KB
14.txt AC 81 ms 13880 KB
15.txt AC 58 ms 13836 KB