Submission #8547562


Source Code Expand

import sys
input = sys.stdin.readline

n,k=map(int,input().split())

a=[int(x) for x in 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]

elif cv[0]==0:
    if cv[1]==1:
        xc=cv[2]
    else:
        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 772 Byte
Status WA
Exec Time 214 ms
Memory 14040 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 4
AC × 17
WA × 2
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 3064 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 3064 KB
subtask_1_03.txt AC 214 ms 14040 KB
subtask_1_04.txt AC 74 ms 13920 KB
subtask_1_05.txt AC 47 ms 8948 KB
subtask_1_06.txt WA 38 ms 4704 KB
subtask_1_07.txt AC 116 ms 9568 KB
subtask_1_08.txt AC 124 ms 12924 KB
subtask_1_09.txt WA 77 ms 7592 KB
subtask_1_10.txt AC 119 ms 10948 KB
subtask_1_11.txt AC 121 ms 12416 KB