Submission #2211764

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define mp(a,b) make_pair(a,b)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
template<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) > (b) ? (b) : (a))

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;

#define INF INT_MAX/3
#define MAX_N 1000
ll n,k;
std::vector<ll> t;
void solve(){
   cin.tie(0);
  ios::sync_with_stdio(false);
  cin>>n>>k;
  t.resize(n);
  rep(i,n) cin>>t[i];
  ll total[n] = {0};
  total[0] = t[0];
  total[1] = t[1] + t[0];
  rep(i,n) total[i] = t[i-2] + t[i-1] + t[i];
  ll ans = -1;
  repl(i,2,n){
    if(total[i] < k){
      ans = i+1;
      break;
    }
  }
  cout<<ans<<endl;
}
int main(){
  solve();
  return 0;
}

Submission Info

Judge Result