Submission #3403862
Source Code Expand
N, K = map(int, input().split())
t = [int(input()) for i in range(N)]
for i in range(2,N):
t[i] += t[i-1] + t[i-2]
if t[i] < K:
print(i+1)
break
else:
print(-1)
Submission Info
| Submission Time | |
|---|---|
| Task | A - ぐっすり |
| User | satoshi_f |
| Language | Python (3.4.3) |
| Score | 0 |
| Code Size | 196 Byte |
| Status | WA |
| Exec Time | 726 ms |
| Memory | 463012 KB |
Judge Result
| Set Name | Sample | All | ||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 0 / 100 | ||||||||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample_01.txt, sample_02.txt, sample_03.txt |
| All | sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| sample_01.txt | WA | 17 ms | 2940 KB |
| sample_02.txt | AC | 17 ms | 2940 KB |
| sample_03.txt | AC | 17 ms | 2940 KB |
| subtask1_01.txt | AC | 138 ms | 5896 KB |
| subtask1_02.txt | AC | 54 ms | 4012 KB |
| subtask1_03.txt | WA | 72 ms | 20724 KB |
| subtask1_04.txt | WA | 51 ms | 11636 KB |
| subtask1_05.txt | WA | 392 ms | 214692 KB |
| subtask1_06.txt | WA | 227 ms | 103300 KB |
| subtask1_07.txt | AC | 124 ms | 5532 KB |
| subtask1_08.txt | AC | 48 ms | 3696 KB |
| subtask1_09.txt | AC | 149 ms | 6172 KB |
| subtask1_10.txt | AC | 126 ms | 5664 KB |
| subtask1_11.txt | WA | 34 ms | 6004 KB |
| subtask1_12.txt | WA | 384 ms | 205968 KB |
| subtask1_13.txt | MLE | 644 ms | 397992 KB |
| subtask1_14.txt | AC | 91 ms | 4748 KB |
| subtask1_15.txt | MLE | 719 ms | 462996 KB |
| subtask1_16.txt | AC | 165 ms | 6536 KB |
| subtask1_17.txt | MLE | 719 ms | 463004 KB |
| subtask1_18.txt | AC | 173 ms | 6420 KB |
| subtask1_19.txt | AC | 166 ms | 6424 KB |
| subtask1_20.txt | MLE | 723 ms | 463004 KB |
| subtask1_21.txt | MLE | 716 ms | 462972 KB |
| subtask1_22.txt | MLE | 718 ms | 463012 KB |
| subtask1_23.txt | MLE | 726 ms | 462984 KB |
| subtask1_24.txt | MLE | 720 ms | 463000 KB |
| subtask1_25.txt | AC | 169 ms | 6536 KB |
| subtask1_26.txt | MLE | 714 ms | 463008 KB |
| subtask1_27.txt | MLE | 724 ms | 462992 KB |
| subtask1_28.txt | MLE | 719 ms | 462980 KB |
| subtask1_29.txt | AC | 176 ms | 6408 KB |
| subtask1_30.txt | MLE | 725 ms | 462756 KB |
| subtask1_31.txt | MLE | 714 ms | 462864 KB |