Submission #4016179
Source Code Expand
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
//
#define int long long
#define pb(x) push_back(x)
#define m0(x) memset((x), 0, sizeof(x))
#define mm(x) memset((x), -1, sizeof(x))
//container
#define ALL(x) (x).begin(), (x).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
#define PERM(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
// debug
#define GET_VAR_NAME(variable) #variable
#define test(x) cout << GET_VAR_NAME(x) << " = " << x << endl;
// bit_macro
#define bit(n) (1LL << (n))
#define bitset(a, b) (a) |= (1 << (b))
#define bitunset(a, b) (a) |= ~(1 << (b))
#define bitcheck(a, b) ((((a) >> (b)) & 1) == 1)
#define bitcount(a) __builtin_popcountll((a))
//typedef
typedef long long lint;
typedef unsigned long long ull;
typedef complex<long double> Complex;
typedef pair<int, int> P;
typedef tuple<int, int, int> TP;
typedef vector<int> vec;
typedef vector<vec> mat;
//constant
const int INF = (int)1e18;
const int MOD = (int)1e9 + 7;
const double EPS = (double)1e-10;
const int dx[] = {-1, 0, 0, 1, 0, -1, -1, 1, 1};
const int dy[] = {0, -1, 1, 0, 0, 1, -1, 1, -1};
//
template <typename T>
void chmax(T &a, T b) { a = max(a, b); }
template <typename T>
void chmin(T &a, T b) { a = min(a, b); }
//
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T>
inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
//
struct Accelerate_Cin {
Accelerate_Cin() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
};
signed main() {
int N, K;
cin >> N >> K;
vec t(N);
for (int i = 0; i < N; i++) cin >> t[i];
int p1 = t[0], p2 = t[1];
for (int i = 2; i < N; i++) {
if (p1 + p2 + t[i] < K) {
cout << i + 1 << endl;
return 0;
}
p2 = p1;
p1 = t[i];
}
cout << -1 << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - ぐっすり |
User |
null_null |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
2253 Byte |
Status |
WA |
Exec Time |
24 ms |
Memory |
1024 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 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 |
512 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 |
11 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 |
18 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 |
WA |
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 |
24 ms |
1024 KB |
subtask1_22.txt |
AC |
24 ms |
1024 KB |
subtask1_23.txt |
AC |
24 ms |
1024 KB |
subtask1_24.txt |
AC |
23 ms |
1024 KB |
subtask1_25.txt |
AC |
24 ms |
1024 KB |
subtask1_26.txt |
AC |
23 ms |
1024 KB |
subtask1_27.txt |
AC |
24 ms |
1024 KB |
subtask1_28.txt |
AC |
23 ms |
1024 KB |
subtask1_29.txt |
AC |
23 ms |
1024 KB |
subtask1_30.txt |
AC |
23 ms |
1024 KB |
subtask1_31.txt |
AC |
22 ms |
1024 KB |