Submission #3770103


Source Code Expand

#include<iostream>
#include<algorithm>
using namespace std;

int s[100010];

int main() {
  int N, K;
  cin >> N >> K;
  bool zero = false;
  for (int i = 0; i < N; i++) {
    cin >> s[i];
    if (s[i] == 0) zero = true;
  }
  int ans = 0;
  int cnt = 0;
  long long product = 1;
  int start = 0;
  int end = 0;
  while (end < N) {
    product *= s[end];
    if (product > K) {
      product /= s[start];
      ans = max(ans, cnt);
      start++;
      if (start > end) end = start;
      cnt--;
    } else if (end == N - 1 && product <= K) {
      ans = max(ans, cnt + 1);
    }

    cnt++;
    end++;
  }
  if (zero) ans = N;
  cout << ans << endl;
}

Submission Info

Submission Time
Task C - 列
User oftonkingdom
Language C++14 (GCC 5.4.1)
Score 0
Code Size 690 Byte
Status WA
Exec Time 60 ms
Memory 640 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 20 0 / 80
Status
AC × 4
AC × 25
WA × 2
AC × 33
WA × 11
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 AC 2 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt WA 2 ms 256 KB
subtask1_06.txt WA 2 ms 256 KB
subtask1_07.txt AC 2 ms 256 KB
subtask1_08.txt AC 2 ms 256 KB
subtask1_09.txt AC 1 ms 256 KB
subtask1_10.txt AC 1 ms 256 KB
subtask1_11.txt AC 1 ms 256 KB
subtask1_12.txt AC 2 ms 256 KB
subtask1_13.txt AC 2 ms 256 KB
subtask1_14.txt AC 2 ms 256 KB
subtask1_15.txt AC 2 ms 256 KB
subtask1_16.txt AC 2 ms 256 KB
subtask1_17.txt AC 2 ms 256 KB
subtask1_corner.txt AC 1 ms 256 KB
subtask1_killer1.txt AC 1 ms 256 KB
subtask1_killer2.txt AC 1 ms 256 KB
subtask1_killer3.txt AC 1 ms 256 KB
subtask1_killer4.txt AC 1 ms 256 KB
subtask1_killer5.txt AC 1 ms 256 KB
subtask2_01.txt AC 21 ms 640 KB
subtask2_02.txt AC 19 ms 640 KB
subtask2_03.txt AC 54 ms 640 KB
subtask2_04.txt AC 20 ms 640 KB
subtask2_05.txt WA 53 ms 640 KB
subtask2_06.txt WA 54 ms 640 KB
subtask2_07.txt WA 20 ms 640 KB
subtask2_08.txt WA 21 ms 640 KB
subtask2_09.txt WA 20 ms 640 KB
subtask2_10.txt WA 20 ms 640 KB
subtask2_11.txt WA 20 ms 640 KB
subtask2_12.txt WA 28 ms 640 KB
subtask2_13.txt WA 29 ms 640 KB
subtask2_14.txt AC 29 ms 640 KB
subtask2_15.txt AC 60 ms 640 KB
subtask2_16.txt AC 20 ms 640 KB
subtask2_17.txt AC 20 ms 640 KB