Submission #6395608


Source Code Expand

N, K = map(int, input().split())
A = list(map(int, input().split()))
import itertools
flag = True
while(flag):
    count = 0
    if K in A:
        flag = False
        break
    A_2 = list(itertools.combinations(A,2))
    for comb in A_2:
        diff = abs(comb[0] - comb[1])
        if diff not in A:
            A.append(diff)
        else:
            count += 1
    else:
        if (count == len(A_2)):
            flag = False
if K in A:
    print('POSSIBLE')
else:
    print('IMPOSSIBLE')

Submission Info

Submission Time
Task A - Getting Difference
User xanxus1204
Language Python (3.4.3)
Score 0
Code Size 523 Byte
Status TLE
Exec Time 2234 ms
Memory 1996152 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 4
AC × 11
TLE × 8
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 TLE 2229 ms 1970264 KB
subtask_1_04.txt AC 43 ms 13848 KB
subtask_1_05.txt TLE 2233 ms 1996152 KB
subtask_1_06.txt TLE 2232 ms 1995604 KB
subtask_1_07.txt TLE 2232 ms 1984800 KB
subtask_1_08.txt TLE 2231 ms 1961544 KB
subtask_1_09.txt TLE 2234 ms 1995104 KB
subtask_1_10.txt TLE 2230 ms 1975780 KB
subtask_1_11.txt TLE 2229 ms 1948292 KB