Submission #7077854


Source Code Expand

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <set> 
#include <map>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iomanip>
#define REP(i,n) for(int i=0; i<(n); ++i)
#define FOR(i,a,b) for(int i=(a); i<(b); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const ll INFLL = 1001001001001001001;  // > 10^18
const ll MODLL = (ll)1e9 + 7;
const double EPS = 1e-9;

int main () {
    
    int n,k; cin >>n>>k;
    vector<ll> v(n); REP(i,n) cin >> v[i];

    int res = 0;
    int right = 0;
    ll check = 1;
    for (int left = 0; left < n; left++) {

        // 条件を満たすうちはrightを増やす
        while (right < n && check * v[right] <= k) {
            if (v[right] == 0) {
                cout << n << endl;
                return 0;
            } 
            check *= v[right];
            right++;
        }

        // 「区間を小さくするとfeasibleになる問題」なので不当なres更新が起きない
        res = max(res, right - left);
        
        // leftをインクリメントする準備
        if (left == right) {
            right++;
        } else {
            check /= v[left];
        } 

    }
    
    cout << res << endl;
    return 0;
}

Submission Info

Submission Time
Task C - 列
User celeus
Language C++ (Clang 3.8.0)
Score 100
Code Size 1470 Byte
Status AC
Exec Time 111 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 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 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 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 47 ms 1024 KB
subtask2_02.txt AC 48 ms 1024 KB
subtask2_03.txt AC 111 ms 1024 KB
subtask2_04.txt AC 48 ms 1024 KB
subtask2_05.txt AC 110 ms 1024 KB
subtask2_06.txt AC 111 ms 1024 KB
subtask2_07.txt AC 50 ms 1024 KB
subtask2_08.txt AC 49 ms 1024 KB
subtask2_09.txt AC 50 ms 1024 KB
subtask2_10.txt AC 50 ms 1024 KB
subtask2_11.txt AC 49 ms 1024 KB
subtask2_12.txt AC 64 ms 1024 KB
subtask2_13.txt AC 64 ms 1024 KB
subtask2_14.txt AC 64 ms 1024 KB
subtask2_15.txt AC 111 ms 1024 KB
subtask2_16.txt AC 48 ms 1024 KB
subtask2_17.txt AC 48 ms 1024 KB