Submission #4026594


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define ln '\n'
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for(int i = (a); i <= (int)(b); ++i)
#define FORR(i, a, b) for(int i = (a); i >= (int)(b); --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
typedef vector<P> VP;
typedef vector<PL> VPL;


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, k;
    cin >> n >> k;
    VI t(n);
    REP(i, n) cin >> t[i];
    FOR(i, 2, n - 1) {
        int t_sum = 0;
        REP(j, 3) t_sum += t[i - j];
        if(t_sum < k) {
            cout << i + 1 << ln;
            return 0;
        }
    }
    cout << -1 << ln;
    return 0;
}

Submission Info

Submission Time
Task A - ぐっすり
User moon_light
Language C++14 (GCC 5.4.1)
Score 100
Code Size 874 Byte
Status AC
Exec Time 9 ms
Memory 640 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 34
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 7 ms 640 KB
subtask1_02.txt AC 3 ms 384 KB
subtask1_03.txt AC 3 ms 384 KB
subtask1_04.txt AC 2 ms 256 KB
subtask1_05.txt AC 6 ms 512 KB
subtask1_06.txt AC 5 ms 384 KB
subtask1_07.txt AC 6 ms 512 KB
subtask1_08.txt AC 3 ms 384 KB
subtask1_09.txt AC 8 ms 640 KB
subtask1_10.txt AC 7 ms 512 KB
subtask1_11.txt AC 2 ms 256 KB
subtask1_12.txt AC 6 ms 512 KB
subtask1_13.txt AC 8 ms 640 KB
subtask1_14.txt AC 5 ms 512 KB
subtask1_15.txt AC 9 ms 640 KB
subtask1_16.txt AC 9 ms 640 KB
subtask1_17.txt AC 9 ms 640 KB
subtask1_18.txt AC 9 ms 640 KB
subtask1_19.txt AC 9 ms 640 KB
subtask1_20.txt AC 9 ms 640 KB
subtask1_21.txt AC 9 ms 640 KB
subtask1_22.txt AC 9 ms 640 KB
subtask1_23.txt AC 9 ms 640 KB
subtask1_24.txt AC 9 ms 640 KB
subtask1_25.txt AC 9 ms 640 KB
subtask1_26.txt AC 9 ms 640 KB
subtask1_27.txt AC 9 ms 640 KB
subtask1_28.txt AC 9 ms 640 KB
subtask1_29.txt AC 9 ms 640 KB
subtask1_30.txt AC 8 ms 640 KB
subtask1_31.txt AC 8 ms 640 KB