Submission #3922376
Source Code Expand
#include<iostream> #include<algorithm> #include<string> #include<vector> #include<cmath> #include<map> #include<iomanip> #define int long long #define ll getchar();getchar();return 0; using namespace std; bool prime(int n) { int cnt = 0; for (int i = 1; i <= sqrt(n); i++) { if (n%i == 0)cnt++; } if (cnt != 1)return false; else return n != 1; } int gcd(int x,int y) { int ans; for (int i = (min(x, y)); i >= 1; i--) { if (x%i == 0 && y%i == 0) { ans = i; break; } } return ans; } int lcm(int x, int y) { return x * y / gcd(x, y); } int a[114514]; signed main() { int n, k,ans; cin >> n >> k; for (int i = 0; i < n; i++)cin >> a[i]; for (int i = 0; i < n; i++) { if (i < n - 2) { if (a[i] + a[i + 1] + a[i + 2] < k) { ans = i + 3; break; } else ans = -1; } } cout << ans << endl; ll }
Submission Info
Submission Time | |
---|---|
Task | A - ぐっすり |
User | sanadayukimura73 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 883 Byte |
Status | AC |
Exec Time | 23 ms |
Memory | 1024 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.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_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 19 ms | 896 KB |
subtask1_02.txt | AC | 7 ms | 384 KB |
subtask1_03.txt | AC | 5 ms | 384 KB |
subtask1_04.txt | AC | 4 ms | 384 KB |
subtask1_05.txt | AC | 16 ms | 768 KB |
subtask1_06.txt | AC | 12 ms | 640 KB |
subtask1_07.txt | AC | 17 ms | 768 KB |
subtask1_08.txt | AC | 6 ms | 384 KB |
subtask1_09.txt | AC | 21 ms | 896 KB |
subtask1_10.txt | AC | 19 ms | 896 KB |
subtask1_11.txt | AC | 3 ms | 256 KB |
subtask1_12.txt | AC | 16 ms | 768 KB |
subtask1_13.txt | AC | 22 ms | 1024 KB |
subtask1_14.txt | AC | 12 ms | 640 KB |
subtask1_15.txt | AC | 23 ms | 1024 KB |
subtask1_16.txt | AC | 23 ms | 1024 KB |
subtask1_17.txt | AC | 23 ms | 1024 KB |
subtask1_18.txt | AC | 23 ms | 1024 KB |
subtask1_19.txt | AC | 23 ms | 1024 KB |
subtask1_20.txt | AC | 23 ms | 1024 KB |
subtask1_21.txt | AC | 23 ms | 1024 KB |
subtask1_22.txt | AC | 23 ms | 1024 KB |
subtask1_23.txt | AC | 23 ms | 1024 KB |
subtask1_24.txt | AC | 23 ms | 1024 KB |
subtask1_25.txt | AC | 23 ms | 1024 KB |
subtask1_26.txt | AC | 23 ms | 1024 KB |
subtask1_27.txt | AC | 23 ms | 1024 KB |
subtask1_28.txt | AC | 23 ms | 1024 KB |
subtask1_29.txt | AC | 23 ms | 1024 KB |
subtask1_30.txt | AC | 22 ms | 1024 KB |
subtask1_31.txt | AC | 22 ms | 1024 KB |