Submission #3003022


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define EACH(i,a) for (auto& i : a)
#define FOR(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define RFOR(i,a,b) for(int i=(int)b-1;i>=(int)a;--i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define debug(x) cerr << #x << ":" << x << endl;
#define OK(ok) cout << (ok ? "Yes" : "No") << endl;
typedef long long ll;

void CINT(){}
template <class Head,class... Tail>
void CINT(Head&& head,Tail&&... tail) {
  cin >> head; CINT(move(tail)...);
}
#define CIN(...) int __VA_ARGS__;CINT(__VA_ARGS__)
#define LCIN(...) ll __VA_ARGS__;CINT(__VA_ARGS__)
#define SCIN(...) string __VA_ARGS__;CINT(__VA_ARGS__)

const int INF = 1e9 + 1;
const int MOD = 1e9 + 7;
const int MAX_N = 1e5 + 1;

int main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);

  CIN(N, K);
  vector< ll > S(N);
  bool ok = false;
  bool ng = true;
  REP(i, N) {
    cin >> S[i];
    // 0が1つでも含まレている時の答えはN
    ok |= (S[i] == 0);
    // 全てKより大きい時の答えは0
    ng &= (S[i] > K);
  }
  if (ok){
    cout << N << endl;
    return 0;
  }
  if (ng) {
    cout << 0 << endl;
    return 0;
  }
  
  
  ll tmp = 1ll;
  int ans = 0;
  int ub = 0;
  REP(lb, N) {
    ub = max(ub, lb);
    while (ub < N) {
      // 掛け合わせてK以上の時はスルー
      if (tmp * S[ub] >= K) {
	break;
      }
      tmp *= S[ub++];
      ans = max(ans, ub - lb + 1);
    }
    if (tmp == 1ll) continue;
    tmp /= S[lb];
  }

  cout << ans << endl;

  return 0;
}

Submission Info

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

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 20 0 / 80
Status
AC × 4
AC × 10
WA × 17
AC × 13
WA × 31
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 WA 1 ms 256 KB
subtask1_03.txt WA 1 ms 256 KB
subtask1_04.txt WA 1 ms 256 KB
subtask1_05.txt AC 1 ms 256 KB
subtask1_06.txt AC 1 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 1 ms 256 KB
subtask1_16.txt WA 1 ms 256 KB
subtask1_17.txt WA 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 WA 1 ms 256 KB
subtask1_killer4.txt AC 1 ms 256 KB
subtask1_killer5.txt WA 1 ms 256 KB
subtask2_01.txt AC 7 ms 1024 KB
subtask2_02.txt WA 7 ms 1024 KB
subtask2_03.txt WA 13 ms 1024 KB
subtask2_04.txt WA 8 ms 1024 KB
subtask2_05.txt AC 11 ms 1024 KB
subtask2_06.txt AC 11 ms 1024 KB
subtask2_07.txt WA 9 ms 1024 KB
subtask2_08.txt WA 9 ms 1024 KB
subtask2_09.txt WA 9 ms 1024 KB
subtask2_10.txt WA 9 ms 1024 KB
subtask2_11.txt WA 9 ms 1024 KB
subtask2_12.txt WA 9 ms 1024 KB
subtask2_13.txt WA 9 ms 1024 KB
subtask2_14.txt WA 10 ms 1024 KB
subtask2_15.txt WA 12 ms 1024 KB
subtask2_16.txt WA 8 ms 1024 KB
subtask2_17.txt WA 8 ms 1024 KB