Submission #7077709
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<int> v(n); REP(i,n) cin >> v[i]; int res = 0; int right = 0; int check = 1; for (int left = 0; left < n; left++) { if (v[right] == 0) { cout << n << endl; return 0; } // 条件を満たすうちはrightを増やす while (right < n && check * v[right] <= k) { 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 | 0 |
Code Size | 1466 Byte |
Status | RE |
Exec Time | 112 ms |
Memory | 768 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 20 | 0 / 80 | ||||||||||||||||
Status |
|
|
|
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 | RE | 99 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 | WA | 2 ms | 256 KB |
subtask1_04.txt | WA | 2 ms | 256 KB |
subtask1_05.txt | AC | 2 ms | 256 KB |
subtask1_06.txt | AC | 2 ms | 256 KB |
subtask1_07.txt | WA | 2 ms | 256 KB |
subtask1_08.txt | WA | 2 ms | 256 KB |
subtask1_09.txt | WA | 2 ms | 256 KB |
subtask1_10.txt | WA | 2 ms | 256 KB |
subtask1_11.txt | WA | 2 ms | 256 KB |
subtask1_12.txt | WA | 2 ms | 256 KB |
subtask1_13.txt | WA | 2 ms | 256 KB |
subtask1_14.txt | WA | 2 ms | 256 KB |
subtask1_15.txt | WA | 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 | WA | 1 ms | 256 KB |
subtask1_killer2.txt | WA | 1 ms | 256 KB |
subtask1_killer3.txt | WA | 1 ms | 256 KB |
subtask1_killer4.txt | WA | 1 ms | 256 KB |
subtask1_killer5.txt | WA | 1 ms | 256 KB |
subtask2_01.txt | AC | 47 ms | 640 KB |
subtask2_02.txt | AC | 47 ms | 640 KB |
subtask2_03.txt | WA | 111 ms | 640 KB |
subtask2_04.txt | WA | 48 ms | 640 KB |
subtask2_05.txt | AC | 112 ms | 640 KB |
subtask2_06.txt | AC | 111 ms | 640 KB |
subtask2_07.txt | WA | 48 ms | 640 KB |
subtask2_08.txt | WA | 48 ms | 640 KB |
subtask2_09.txt | WA | 49 ms | 768 KB |
subtask2_10.txt | WA | 49 ms | 640 KB |
subtask2_11.txt | WA | 48 ms | 640 KB |
subtask2_12.txt | WA | 63 ms | 640 KB |
subtask2_13.txt | WA | 64 ms | 640 KB |
subtask2_14.txt | WA | 63 ms | 640 KB |
subtask2_15.txt | WA | 111 ms | 640 KB |
subtask2_16.txt | WA | 48 ms | 640 KB |
subtask2_17.txt | WA | 48 ms | 640 KB |