Submission #8435958

Source Code Expand

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

b = []

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

for i in a:
  if abs(i-k) % c == 0:
    print("POSIIBLE")
    sys.exit()
    
print("IMPOSIIBLE")

Submission Info

Submission Time
Task A - Getting Difference
User bored_funuke
Language Python (3.4.3)
Score 0
Code Size 297 Byte
Status RE
Exec Time 315 ms
Memory 23080 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
WA × 4
WA × 17
RE × 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 WA 148 ms 12392 KB
sample_02.txt WA 147 ms 12396 KB
sample_03.txt WA 147 ms 12392 KB
sample_04.txt WA 146 ms 12424 KB
subtask_1_01.txt RE 152 ms 12392 KB
subtask_1_02.txt RE 148 ms 12396 KB
subtask_1_03.txt WA 217 ms 23080 KB
subtask_1_04.txt WA 207 ms 22972 KB
subtask_1_05.txt WA 178 ms 17880 KB
subtask_1_06.txt WA 158 ms 13784 KB
subtask_1_07.txt WA 277 ms 18640 KB
subtask_1_08.txt WA 205 ms 21992 KB
subtask_1_09.txt WA 172 ms 16440 KB
subtask_1_10.txt WA 315 ms 19816 KB
subtask_1_11.txt WA 200 ms 21000 KB