Submission #5909108
Source Code Expand
N, K = map(int, input().split()) *A, = map(int, input().split()) A = sorted(A) diff = min([A[i+1] - A[i] for i in range(N-1) if A[i+1] - A[i] > 0]) for a in [a for a in A if a >= K]: if (a - K) % diff == 0: print('POSSIBLE') break else: print('IMPOSSIBLE')
Submission Info
Submission Time | |
---|---|
Task | A - Getting Difference |
User | taq225 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 289 Byte |
Status | RE |
Exec Time | 111 ms |
Memory | 14224 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 17 ms | 3060 KB |
sample_02.txt | AC | 17 ms | 3060 KB |
sample_03.txt | AC | 17 ms | 2940 KB |
sample_04.txt | AC | 17 ms | 3060 KB |
subtask_1_01.txt | RE | 17 ms | 3060 KB |
subtask_1_02.txt | RE | 17 ms | 2940 KB |
subtask_1_03.txt | AC | 111 ms | 14224 KB |
subtask_1_04.txt | RE | 54 ms | 13852 KB |
subtask_1_05.txt | RE | 37 ms | 8948 KB |
subtask_1_06.txt | AC | 30 ms | 4560 KB |
subtask_1_07.txt | AC | 79 ms | 9628 KB |
subtask_1_08.txt | AC | 97 ms | 13384 KB |
subtask_1_09.txt | AC | 53 ms | 7520 KB |
subtask_1_10.txt | AC | 88 ms | 10856 KB |
subtask_1_11.txt | AC | 92 ms | 12424 KB |