Submission #1512724
Source Code Expand
def main(): N = int(input()) A = tuple(map(int, input().split())) a = sorted(A) max_ = max(a) x2 = set() for i in a: if i * 2 <= max_: x2.add(i * 2) num = set(a) - x2 print(len(num)) main()
Submission Info
Submission Time | |
---|---|
Task | C - 高橋くんと魔法の箱 |
User | agw02010 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 260 Byte |
Status | WA |
Exec Time | 118 ms |
Memory | 22724 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 | 2940 KB |
subtask0_1.txt | AC | 17 ms | 2940 KB |
subtask0_2.txt | AC | 17 ms | 2940 KB |
subtask1_0.txt | AC | 18 ms | 3700 KB |
subtask1_1.txt | WA | 19 ms | 3700 KB |
subtask1_10.txt | AC | 18 ms | 3700 KB |
subtask1_11.txt | AC | 19 ms | 3828 KB |
subtask1_12.txt | AC | 19 ms | 3828 KB |
subtask1_13.txt | AC | 20 ms | 3828 KB |
subtask1_14.txt | AC | 19 ms | 3828 KB |
subtask1_15.txt | AC | 19 ms | 3828 KB |
subtask1_16.txt | AC | 19 ms | 3828 KB |
subtask1_17.txt | AC | 19 ms | 3828 KB |
subtask1_18.txt | AC | 19 ms | 3828 KB |
subtask1_19.txt | AC | 19 ms | 3828 KB |
subtask1_2.txt | WA | 19 ms | 3700 KB |
subtask1_3.txt | WA | 19 ms | 3700 KB |
subtask1_4.txt | WA | 19 ms | 3700 KB |
subtask1_5.txt | WA | 19 ms | 3700 KB |
subtask1_6.txt | WA | 19 ms | 3700 KB |
subtask1_7.txt | WA | 19 ms | 3700 KB |
subtask1_8.txt | WA | 19 ms | 3700 KB |
subtask1_9.txt | WA | 19 ms | 3700 KB |
subtask2_0.txt | AC | 62 ms | 22516 KB |
subtask2_1.txt | WA | 111 ms | 22716 KB |
subtask2_2.txt | WA | 108 ms | 22720 KB |
subtask2_3.txt | WA | 109 ms | 22716 KB |
subtask2_4.txt | WA | 109 ms | 22420 KB |
subtask2_5.txt | WA | 110 ms | 22424 KB |
subtask2_6.txt | WA | 109 ms | 22724 KB |
subtask2_7.txt | WA | 108 ms | 22420 KB |
subtask2_8.txt | WA | 108 ms | 22716 KB |
subtask2_9.txt | WA | 108 ms | 22424 KB |
subtask3_0.txt | AC | 63 ms | 22516 KB |
subtask3_1.txt | WA | 113 ms | 22528 KB |
subtask3_2.txt | WA | 114 ms | 22528 KB |
subtask3_3.txt | WA | 112 ms | 22524 KB |
subtask3_4.txt | WA | 112 ms | 22536 KB |
subtask3_5.txt | WA | 115 ms | 22524 KB |
subtask3_6.txt | WA | 113 ms | 22532 KB |
subtask3_7.txt | WA | 118 ms | 22532 KB |
subtask3_8.txt | WA | 113 ms | 22400 KB |
subtask3_9.txt | WA | 112 ms | 22528 KB |