Submission #1445291


Source Code Expand

N,K=map(int, input().split())
A=list(map(int, input().split())) 
A.sort(reverse=1)
m=A[0]
for i in range(N-1):
  m=min(m,A[i]-A[i+1])
amari=[0]*m
for j in range(m):
  for i in range(N):
    if A[i]%m==j:
      amari[j]=1
n=K%m
if K>A[0]:
  print("IMPOSSIBLE")
elif amari[n]:
  print("POSSIBLE")
else:
  print("IMPOSSIBLE")

Submission Info

Submission Time
Task A - Getting Difference
User wkb89_
Language Python (3.4.3)
Score 0
Code Size 339 Byte
Status RE
Exec Time 2112 ms
Memory 14224 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 4
AC × 8
TLE × 1
RE × 10
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 RE 17 ms 3064 KB
subtask_1_02.txt TLE 2112 ms -950284 KB
subtask_1_03.txt RE 113 ms 14224 KB
subtask_1_04.txt RE 77 ms 13848 KB
subtask_1_05.txt RE 48 ms 8824 KB
subtask_1_06.txt RE 30 ms 4564 KB
subtask_1_07.txt RE 72 ms 9628 KB
subtask_1_08.txt RE 104 ms 13756 KB
subtask_1_09.txt RE 54 ms 8800 KB
subtask_1_10.txt RE 84 ms 10852 KB
subtask_1_11.txt RE 96 ms 12420 KB