Submission #7098427
Source Code Expand
#include <iostream> #include <vector> #include <string> #include <cstring> #include <queue> #include <set> #include <stack> #include <map> #include <unordered_map> #include <cmath> #include <utility> // pair make_pair #include <algorithm> #include <iomanip> #define m0(x) memset(x,0,sizeof(x)) #define m1(x) memset(x,63,sizeof(x)) #define fill(x,y) memset(x,y,sizeof(x)) #define ll long long //#define int ll using namespace std; using Graph = vector<vector<int> >; int Input[100100]; int main() { int N, K; cin >> N >> K; bool flag = false; for (int i = 0; i < N; i++) { cin >> Input[i]; if (Input[i] == 0) { flag = true; } } if (flag) { cout << N << endl; return 0; } int right = 0; int sum = 1; int ans = -1; for (int left = 0; left < N; left++) { while (right < N && sum * Input[right] <= 6) { sum *= Input[right]; right++; } ans = max(ans, right - left); if (right == left) { right++; } else { sum /= Input[left]; } } cout << ans << endl; } // int right = 0; // for (int left = 0; left < n; ++left) { // while (right < n && (right を 1 個進めたときに条件を満たす)) { // /* 実際に right を 1 進める */ // // ex: sum += a[right]; // ++right; // } // /* break した状態で right は条件を満たす最大なので、何かする */ // // ex: res += (right - left); // /* left をインクリメントする準備 */ // // ex: if (right == left) ++right; // // ex: else sum -= a[left]; // }
Submission Info
Submission Time | |
---|---|
Task | C - 列 |
User | lagomnist |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1646 Byte |
Status | WA |
Exec Time | 59 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 | AC | 1 ms | 256 KB |
subtask0_sample_03.txt | AC | 1 ms | 256 KB |
subtask0_sample_04.txt | WA | 1 ms | 256 KB |
subtask1_01.txt | WA | 2 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | WA | 2 ms | 256 KB |
subtask1_04.txt | WA | 1 ms | 256 KB |
subtask1_05.txt | AC | 2 ms | 256 KB |
subtask1_06.txt | AC | 2 ms | 256 KB |
subtask1_07.txt | WA | 1 ms | 256 KB |
subtask1_08.txt | WA | 1 ms | 256 KB |
subtask1_09.txt | WA | 2 ms | 256 KB |
subtask1_10.txt | WA | 2 ms | 256 KB |
subtask1_11.txt | WA | 1 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 | 1 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 | WA | 20 ms | 640 KB |
subtask2_02.txt | AC | 20 ms | 640 KB |
subtask2_03.txt | WA | 54 ms | 640 KB |
subtask2_04.txt | WA | 20 ms | 640 KB |
subtask2_05.txt | AC | 53 ms | 640 KB |
subtask2_06.txt | AC | 54 ms | 640 KB |
subtask2_07.txt | WA | 20 ms | 768 KB |
subtask2_08.txt | WA | 20 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 | 27 ms | 640 KB |
subtask2_13.txt | WA | 27 ms | 640 KB |
subtask2_14.txt | WA | 27 ms | 640 KB |
subtask2_15.txt | WA | 59 ms | 640 KB |
subtask2_16.txt | WA | 20 ms | 640 KB |
subtask2_17.txt | WA | 20 ms | 640 KB |