Submission #1511859
Source Code Expand
def main(): N = int(input()) A = tuple(map(int, input().split())) a2 = [x * 2 for x in A] num = set(list(A) + a2) ans = len(num) - len(A) if len(num) > len(A) else 1 print(ans) main()
Submission Info
Submission Time | |
---|---|
Task | C - 高橋くんと魔法の箱 |
User | agw02010 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 220 Byte |
Status | WA |
Exec Time | 70 ms |
Memory | 25916 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | All | ||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 20 | 0 / 30 | 0 / 50 | ||||||||||||||
Status |
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
Subtask1 | subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
Subtask2 | subtask2_0.txt, subtask2_1.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
All | subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask2_0.txt, subtask2_1.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt, subtask3_0.txt, subtask3_1.txt, subtask3_2.txt, subtask3_3.txt, subtask3_4.txt, subtask3_5.txt, subtask3_6.txt, subtask3_7.txt, subtask3_8.txt, subtask3_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_0.txt | AC | 17 ms | 3060 KB |
subtask0_1.txt | AC | 17 ms | 2940 KB |
subtask0_2.txt | AC | 17 ms | 2940 KB |
subtask1_0.txt | AC | 18 ms | 4084 KB |
subtask1_1.txt | WA | 18 ms | 4084 KB |
subtask1_10.txt | AC | 18 ms | 4084 KB |
subtask1_11.txt | AC | 18 ms | 4212 KB |
subtask1_12.txt | AC | 18 ms | 4212 KB |
subtask1_13.txt | AC | 18 ms | 4212 KB |
subtask1_14.txt | AC | 18 ms | 4084 KB |
subtask1_15.txt | AC | 18 ms | 4212 KB |
subtask1_16.txt | AC | 18 ms | 4084 KB |
subtask1_17.txt | AC | 18 ms | 4212 KB |
subtask1_18.txt | AC | 18 ms | 4212 KB |
subtask1_19.txt | AC | 18 ms | 4212 KB |
subtask1_2.txt | WA | 17 ms | 4084 KB |
subtask1_3.txt | WA | 17 ms | 4084 KB |
subtask1_4.txt | WA | 18 ms | 4084 KB |
subtask1_5.txt | WA | 17 ms | 4084 KB |
subtask1_6.txt | WA | 17 ms | 4084 KB |
subtask1_7.txt | WA | 17 ms | 4084 KB |
subtask1_8.txt | WA | 18 ms | 4084 KB |
subtask1_9.txt | WA | 17 ms | 4084 KB |
subtask2_0.txt | AC | 56 ms | 25716 KB |
subtask2_1.txt | WA | 65 ms | 25916 KB |
subtask2_2.txt | WA | 65 ms | 25916 KB |
subtask2_3.txt | WA | 65 ms | 25916 KB |
subtask2_4.txt | WA | 65 ms | 25600 KB |
subtask2_5.txt | WA | 66 ms | 25916 KB |
subtask2_6.txt | WA | 65 ms | 25916 KB |
subtask2_7.txt | WA | 66 ms | 25600 KB |
subtask2_8.txt | WA | 66 ms | 25916 KB |
subtask2_9.txt | WA | 65 ms | 25748 KB |
subtask3_0.txt | AC | 56 ms | 25716 KB |
subtask3_1.txt | WA | 68 ms | 25628 KB |
subtask3_2.txt | WA | 68 ms | 25620 KB |
subtask3_3.txt | WA | 69 ms | 25620 KB |
subtask3_4.txt | WA | 68 ms | 25496 KB |
subtask3_5.txt | WA | 69 ms | 25616 KB |
subtask3_6.txt | WA | 69 ms | 25500 KB |
subtask3_7.txt | WA | 68 ms | 25620 KB |
subtask3_8.txt | WA | 68 ms | 25500 KB |
subtask3_9.txt | WA | 70 ms | 25620 KB |