Submission #8435973
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 = int(np.min(b)) for i in a: if abs(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 | 302 Byte |
Status | RE |
Exec Time | 214 ms |
Memory | 23128 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 | 170 ms | 13852 KB |
sample_02.txt | AC | 148 ms | 12396 KB |
sample_03.txt | AC | 149 ms | 12396 KB |
sample_04.txt | WA | 149 ms | 12392 KB |
subtask_1_01.txt | RE | 152 ms | 12500 KB |
subtask_1_02.txt | RE | 150 ms | 12392 KB |
subtask_1_03.txt | AC | 214 ms | 23128 KB |
subtask_1_04.txt | RE | 208 ms | 22972 KB |
subtask_1_05.txt | RE | 181 ms | 17880 KB |
subtask_1_06.txt | AC | 157 ms | 13784 KB |
subtask_1_07.txt | AC | 197 ms | 18628 KB |
subtask_1_08.txt | RE | 205 ms | 21992 KB |
subtask_1_09.txt | AC | 174 ms | 16468 KB |
subtask_1_10.txt | AC | 204 ms | 19820 KB |
subtask_1_11.txt | RE | 198 ms | 20948 KB |