Submission #8435999


Source Code Expand

import numpy as np
import sys
n,k = map(int,input().split())
a = list(map(int,input().split()))

b = []

if n == 1:
  if a[0] == k:
    print("POSSIBLE")
  else:
    print("IMPOSSIBLE")
  sys.exit()

for i in range(len(a) - 1):
  b.append(abs(a[i]-a[i+1]))
  
c = int(np.min(b))

for i in a:
  if i - k > 0 and (i-k) % c == 0:
    print("POSSIBLE")
    sys.exit()
    
print("IMPOSSIBLE")
 

Submission Info

Submission Time
Task A - Getting Difference
User bored_funuke
Language Python (3.4.3)
Score 0
Code Size 415 Byte
Status WA
Exec Time 211 ms
Memory 23088 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 4
AC × 18
WA × 1
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 147 ms 12424 KB
sample_02.txt AC 149 ms 12424 KB
sample_03.txt AC 148 ms 12424 KB
sample_04.txt AC 148 ms 12424 KB
subtask_1_01.txt AC 147 ms 12424 KB
subtask_1_02.txt AC 146 ms 12424 KB
subtask_1_03.txt AC 209 ms 23088 KB
subtask_1_04.txt WA 211 ms 22960 KB
subtask_1_05.txt AC 181 ms 17912 KB
subtask_1_06.txt AC 155 ms 13688 KB
subtask_1_07.txt AC 193 ms 18628 KB
subtask_1_08.txt AC 207 ms 22024 KB
subtask_1_09.txt AC 171 ms 16480 KB
subtask_1_10.txt AC 202 ms 19844 KB
subtask_1_11.txt AC 204 ms 20980 KB