Submission #3943916

Source Code Expand

N, K = map(int, input().split())
*A, = map(int, input().split())

dp = [0]*(K+1)
for c in range(K+1):
    for a in A:
        if a <= c and not dp[c-a]:
            dp[c] = 1
            break
print('First' if dp[K] else 'Second')

Submission Info

Submission Time
Task K - Stones
User yaketake08
Language PyPy3 (2.4.0)
Score 100
Code Size 239 Byte
Status AC
Exec Time 219 ms
Memory 41836 KiB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 28
Set Name Test Cases
All 0_00, 0_01, 0_02, 0_03, 0_04, 0_05, 1_00, 1_01, 1_02, 1_03, 1_04, 1_05, 1_06, 1_07, 1_08, 1_09, 1_10, 1_11, 1_12, 1_13, 1_14, 1_15, 1_16, 1_17, 1_18, 1_19, 1_20, 1_21
Case Name Status Exec Time Memory
0_00 AC 170 ms 38632 KiB
0_01 AC 162 ms 38384 KiB
0_02 AC 160 ms 38256 KiB
0_03 AC 159 ms 38256 KiB
0_04 AC 159 ms 38256 KiB
0_05 AC 171 ms 40048 KiB
1_00 AC 160 ms 38256 KiB
1_01 AC 166 ms 39408 KiB
1_02 AC 163 ms 39280 KiB
1_03 AC 203 ms 41196 KiB
1_04 AC 202 ms 41068 KiB
1_05 AC 200 ms 41068 KiB
1_06 AC 212 ms 41708 KiB
1_07 AC 219 ms 41580 KiB
1_08 AC 217 ms 41708 KiB
1_09 AC 212 ms 41708 KiB
1_10 AC 209 ms 41580 KiB
1_11 AC 214 ms 41580 KiB
1_12 AC 213 ms 41452 KiB
1_13 AC 211 ms 41836 KiB
1_14 AC 211 ms 41836 KiB
1_15 AC 216 ms 41580 KiB
1_16 AC 208 ms 41580 KiB
1_17 AC 209 ms 41580 KiB
1_18 AC 210 ms 41580 KiB
1_19 AC 210 ms 41580 KiB
1_20 AC 209 ms 41580 KiB
1_21 AC 214 ms 41580 KiB