Submission #6908239


Source Code Expand

#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, e) for (int i = (s); i < (int)(e); ++i)
using namespace std;
using ll = long long;

int main() {
  ll N, K;
  cin >> N >> K;
  vector<ll> s(N);

  rep (i, N) {
    cin >> s[i];
  }
  if (find(s.begin(), s.end(), 0) != s.end()) {
    cout << s.size() << endl;
    return 0;
  }

  ll l = 0;
  ll r = 0;
  ll p = 1;
  ll ans = 0;
  while (r < N) {
    while (r < N && p * s[r] <= K) {
      p *= s[r];
      r += 1;
    }
    ans = max(ans, r - l);
    do {
      p /= s[l];
      l += 1;
    } while (l < r && p > K);
    r = max(l, r);
    p = max(p, 1LL);
  }
  cout << ans << endl;
}

Submission Info

Submission Time
Task C - 列
User nohtaray
Language C++14 (GCC 5.4.1)
Score 100
Code Size 721 Byte
Status AC
Exec Time 45 ms
Memory 1024 KB

Judge Result

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