Submission #5909152
Source Code Expand
N, K = map(int, input().split()) *A, = map(int, input().split()) A = sorted(A) if K in A: print('POSSIBLE') else: temp = [A[i+1] - A[i] for i in range(N-1) if A[i+1] - A[i] > 0] diff = min(temp) if temp else -1 if diff == -1: print('IMPOSSIBLE') else: 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 | 300 |
Code Size | 476 Byte |
Status | AC |
Exec Time | 114 ms |
Memory | 14224 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 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 | 3064 KB |
sample_02.txt | AC | 17 ms | 3060 KB |
sample_03.txt | AC | 17 ms | 3064 KB |
sample_04.txt | AC | 17 ms | 3064 KB |
subtask_1_01.txt | AC | 17 ms | 3064 KB |
subtask_1_02.txt | AC | 17 ms | 3060 KB |
subtask_1_03.txt | AC | 114 ms | 14224 KB |
subtask_1_04.txt | AC | 44 ms | 14104 KB |
subtask_1_05.txt | AC | 38 ms | 8824 KB |
subtask_1_06.txt | AC | 31 ms | 4564 KB |
subtask_1_07.txt | AC | 77 ms | 9628 KB |
subtask_1_08.txt | AC | 97 ms | 13756 KB |
subtask_1_09.txt | AC | 56 ms | 7392 KB |
subtask_1_10.txt | AC | 88 ms | 10948 KB |
subtask_1_11.txt | AC | 94 ms | 12028 KB |