Submission #3419883
Source Code Expand
n,k = map(int,input().split()) s = [] for _ in [0]*n: s += [int(input())] if 0 in s: print(n) exit() m = 0 for i in range(n): x = 1 j = i while j<n and x*s[j]<=k: x *= s[j] j += 1 m = max(m,j-i) print(m)
Submission Info
Submission Time | |
---|---|
Task | C - 列 |
User | minefy |
Language | Python (3.4.3) |
Score | 20 |
Code Size | 240 Byte |
Status | TLE |
Exec Time | 2104 ms |
Memory | 7840 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 20 / 20 | 0 / 80 | ||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt |
Subtask1 | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.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_corner.txt, subtask1_killer1.txt, subtask1_killer2.txt, subtask1_killer3.txt, subtask1_killer4.txt, subtask1_killer5.txt |
Subtask2 | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.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_corner.txt, subtask1_killer1.txt, subtask1_killer2.txt, subtask1_killer3.txt, subtask1_killer4.txt, subtask1_killer5.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 17 ms | 3060 KB |
subtask0_sample_02.txt | AC | 17 ms | 3060 KB |
subtask0_sample_03.txt | AC | 17 ms | 2940 KB |
subtask0_sample_04.txt | AC | 17 ms | 3060 KB |
subtask1_01.txt | AC | 19 ms | 3060 KB |
subtask1_02.txt | AC | 202 ms | 3060 KB |
subtask1_03.txt | AC | 20 ms | 3060 KB |
subtask1_04.txt | AC | 41 ms | 3060 KB |
subtask1_05.txt | AC | 19 ms | 3060 KB |
subtask1_06.txt | AC | 19 ms | 3060 KB |
subtask1_07.txt | AC | 26 ms | 3060 KB |
subtask1_08.txt | AC | 27 ms | 3060 KB |
subtask1_09.txt | AC | 26 ms | 3060 KB |
subtask1_10.txt | AC | 26 ms | 3060 KB |
subtask1_11.txt | AC | 27 ms | 3060 KB |
subtask1_12.txt | AC | 20 ms | 3060 KB |
subtask1_13.txt | AC | 20 ms | 3060 KB |
subtask1_14.txt | AC | 20 ms | 3060 KB |
subtask1_15.txt | AC | 20 ms | 3060 KB |
subtask1_16.txt | AC | 178 ms | 3060 KB |
subtask1_17.txt | AC | 173 ms | 3060 KB |
subtask1_corner.txt | AC | 17 ms | 3060 KB |
subtask1_killer1.txt | AC | 17 ms | 3060 KB |
subtask1_killer2.txt | AC | 16 ms | 3060 KB |
subtask1_killer3.txt | AC | 17 ms | 3060 KB |
subtask1_killer4.txt | AC | 17 ms | 3060 KB |
subtask1_killer5.txt | AC | 17 ms | 3064 KB |
subtask2_01.txt | AC | 258 ms | 4628 KB |
subtask2_02.txt | TLE | 2104 ms | 4632 KB |
subtask2_03.txt | AC | 280 ms | 7840 KB |
subtask2_04.txt | TLE | 2104 ms | 4632 KB |
subtask2_05.txt | AC | 243 ms | 7836 KB |
subtask2_06.txt | AC | 236 ms | 7840 KB |
subtask2_07.txt | AC | 995 ms | 4632 KB |
subtask2_08.txt | AC | 1180 ms | 4648 KB |
subtask2_09.txt | AC | 1048 ms | 4632 KB |
subtask2_10.txt | AC | 1096 ms | 4648 KB |
subtask2_11.txt | AC | 976 ms | 4648 KB |
subtask2_12.txt | AC | 353 ms | 7056 KB |
subtask2_13.txt | AC | 371 ms | 7060 KB |
subtask2_14.txt | AC | 367 ms | 7068 KB |
subtask2_15.txt | AC | 284 ms | 7840 KB |
subtask2_16.txt | TLE | 2104 ms | 4632 KB |
subtask2_17.txt | TLE | 2104 ms | 4648 KB |