Submission #6900587


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, k;
    cin >> n >> k;
    vector<long long> s(n);
    for (int i = 0; i < n; i++) {
        cin >> s.at(i);
        if (s.at(i) == 0) {
            cout << n << endl;
            return 0;
        }
    }

    int ans = 0;
    int right = 0;
    long long pro = 1;
    for (int left = 0; left < n; ++left) {
        while (right < n && pro + s.at(right) <= k) {
            pro *= s.at(right);
            right++;
        }
        
        ans = max(ans, right - left);

        if (right == left) right++;
        else pro /= s.at(left);
    }
    cout << ans << endl;
}       

Submission Info

Submission Time
Task C - 列
User karyo
Language C++14 (GCC 5.4.1)
Score 0
Code Size 681 Byte
Status WA
Exec Time 43 ms
Memory 1024 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 20 0 / 80
Status
AC × 4
AC × 14
WA × 13
AC × 18
WA × 26
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 1 ms 256 KB
subtask0_sample_02.txt AC 1 ms 256 KB
subtask0_sample_03.txt AC 1 ms 256 KB
subtask0_sample_04.txt AC 1 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt WA 2 ms 256 KB
subtask1_04.txt WA 1 ms 256 KB
subtask1_05.txt AC 2 ms 256 KB
subtask1_06.txt AC 2 ms 256 KB
subtask1_07.txt WA 1 ms 256 KB
subtask1_08.txt WA 1 ms 256 KB
subtask1_09.txt WA 1 ms 256 KB
subtask1_10.txt WA 1 ms 256 KB
subtask1_11.txt WA 1 ms 256 KB
subtask1_12.txt WA 1 ms 256 KB
subtask1_13.txt WA 1 ms 256 KB
subtask1_14.txt WA 1 ms 256 KB
subtask1_15.txt WA 2 ms 256 KB
subtask1_16.txt AC 1 ms 256 KB
subtask1_17.txt AC 1 ms 256 KB
subtask1_corner.txt AC 1 ms 256 KB
subtask1_killer1.txt AC 1 ms 256 KB
subtask1_killer2.txt WA 1 ms 256 KB
subtask1_killer3.txt AC 1 ms 256 KB
subtask1_killer4.txt AC 1 ms 256 KB
subtask1_killer5.txt WA 1 ms 256 KB
subtask2_01.txt AC 17 ms 1024 KB
subtask2_02.txt AC 18 ms 1024 KB
subtask2_03.txt WA 42 ms 1024 KB
subtask2_04.txt WA 18 ms 1024 KB
subtask2_05.txt AC 40 ms 1024 KB
subtask2_06.txt AC 40 ms 1024 KB
subtask2_07.txt WA 19 ms 1024 KB
subtask2_08.txt WA 19 ms 1024 KB
subtask2_09.txt WA 19 ms 1024 KB
subtask2_10.txt WA 19 ms 1024 KB
subtask2_11.txt WA 19 ms 1024 KB
subtask2_12.txt WA 24 ms 1024 KB
subtask2_13.txt WA 24 ms 1024 KB
subtask2_14.txt WA 24 ms 1024 KB
subtask2_15.txt WA 43 ms 1024 KB
subtask2_16.txt WA 18 ms 1024 KB
subtask2_17.txt WA 18 ms 1024 KB