Submission #8547478
Source Code Expand
n,k=map(int,input().split()) a=list(map(int,input().split())) a.sort() bb=set(a) for i in range(n-1): tm=a[i+1]-a[i] bb.add(tm) cv=list(bb) cv.sort() if k in cv: print("POSSIBLE") exit() if max(cv)<k: print("IMPOSSIBLE") exit() if n==1: if a[0]==k: print("POSSIBLE") else: print("IMPOSSIBLE") exit() xc=0 cb=False if cv[0]==1: xc=cv[1] else: xc=cv[0] for i in range(len(cv)): if cv[i]%xc!=0: cb=True if k<=max(cv): if cb: print("POSSIBLE") else: print("IMPOSSIBLE") exit() print("IMPOSSIBLE")
Submission Info
Submission Time | |
---|---|
Task | A - Getting Difference |
User | melonoidz |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 646 Byte |
Status | RE |
Exec Time | 186 ms |
Memory | 14096 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 | 18 ms | 3064 KB |
sample_02.txt | AC | 18 ms | 3064 KB |
sample_03.txt | AC | 18 ms | 3064 KB |
sample_04.txt | AC | 18 ms | 3064 KB |
subtask_1_01.txt | AC | 18 ms | 3064 KB |
subtask_1_02.txt | AC | 18 ms | 3064 KB |
subtask_1_03.txt | RE | 186 ms | 14096 KB |
subtask_1_04.txt | AC | 73 ms | 13848 KB |
subtask_1_05.txt | AC | 46 ms | 8824 KB |
subtask_1_06.txt | RE | 36 ms | 4692 KB |
subtask_1_07.txt | RE | 102 ms | 9628 KB |
subtask_1_08.txt | AC | 125 ms | 13380 KB |
subtask_1_09.txt | RE | 72 ms | 7648 KB |
subtask_1_10.txt | RE | 112 ms | 11412 KB |
subtask_1_11.txt | AC | 119 ms | 12028 KB |