Submission #3768070


Source Code Expand

import sys
N,L=map(int,input().split())
A=[int(i) for i in input().split()]
flag=True
a=-1
for i in range(N-1):
    if A[i+1]+A[i]>=L:
        flag=False
        a=i+1
        break
if flag:
    print('Impossible')
    sys.exit()
print('Possible')
for i in range(1,a):
    print(i)
for i in range(a+1,N):
    print(i)
print(a)

Submission Info

Submission Time
Task C - Knot Puzzle
User okumura
Language PyPy3 (2.4.0)
Score 0
Code Size 346 Byte
Status WA
Exec Time 317 ms
Memory 63984 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 3
AC × 27
WA × 8
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt
Case Name Status Exec Time Memory
0_00.txt AC 166 ms 38256 KB
0_01.txt AC 168 ms 38256 KB
0_02.txt AC 167 ms 38256 KB
1_00.txt AC 166 ms 38256 KB
1_01.txt AC 170 ms 38256 KB
1_02.txt AC 265 ms 49792 KB
1_03.txt AC 199 ms 49392 KB
1_04.txt WA 269 ms 49792 KB
1_05.txt AC 207 ms 49392 KB
1_06.txt AC 276 ms 49920 KB
1_07.txt AC 204 ms 49392 KB
1_08.txt AC 274 ms 49792 KB
1_09.txt AC 214 ms 49392 KB
1_10.txt WA 311 ms 52224 KB
1_11.txt AC 211 ms 49392 KB
1_12.txt AC 294 ms 62704 KB
1_13.txt AC 226 ms 62832 KB
1_14.txt AC 294 ms 63984 KB
1_15.txt WA 171 ms 38256 KB
1_16.txt AC 184 ms 38256 KB
1_17.txt AC 245 ms 61808 KB
1_18.txt WA 317 ms 62796 KB
1_19.txt AC 223 ms 62320 KB
1_20.txt AC 221 ms 60016 KB
1_21.txt WA 308 ms 63208 KB
1_22.txt WA 310 ms 63456 KB
1_23.txt AC 226 ms 61552 KB
1_24.txt WA 301 ms 60936 KB
1_25.txt AC 224 ms 61808 KB
1_26.txt WA 304 ms 62156 KB
1_27.txt AC 287 ms 62064 KB
1_28.txt AC 283 ms 61936 KB
1_29.txt AC 278 ms 60016 KB
1_30.txt AC 292 ms 61936 KB
1_31.txt AC 289 ms 60272 KB