Submission #1189704
Source Code Expand
n=int(input()) a=[int(i) for i in input().split()] a.sort() b=[a[0]] def f(i): if i>n-1: print(len(b)) return 0 if a[i]!=b[-1]: b.append(a[i]) f(i+1) else: f(i+2) f(1)
Submission Info
Submission Time | |
---|---|
Task | D - Card Eater |
User | tacloth |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 198 Byte |
Status | RE |
Exec Time | 138 ms |
Memory | 14388 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||||
Status |
|
|
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 | 2940 KB |
00_example_02.txt | AC | 17 ms | 2940 KB |
01.txt | AC | 17 ms | 2940 KB |
02.txt | RE | 76 ms | 4200 KB |
03.txt | AC | 17 ms | 3060 KB |
04.txt | WA | 17 ms | 3188 KB |
05.txt | AC | 17 ms | 3060 KB |
06.txt | RE | 125 ms | 14388 KB |
07.txt | RE | 127 ms | 13852 KB |
08.txt | RE | 137 ms | 13812 KB |
09.txt | RE | 122 ms | 13640 KB |
10.txt | RE | 120 ms | 13964 KB |
11.txt | RE | 138 ms | 13880 KB |
12.txt | RE | 125 ms | 13208 KB |
13.txt | RE | 134 ms | 13812 KB |
14.txt | RE | 100 ms | 13812 KB |
15.txt | RE | 102 ms | 13964 KB |