Submission #3915341


Source Code Expand

#include <bits/stdc++.h>
  using namespace std;
#define ll long long
#define fw(p) for(int w=0;w<(p);w++)
#define fx(p) for(int x=0;x<(p);x++)
#define fy(p) for(int y=0;y<(p);y++)
#define fz(p) for(int z=0;z<(p);z++)
#define fyg(p,g) for(int y=(g);y<(p);y++)
#define fzg(p,g) for(int z=(g);z<(p);z++)
#define ce(d) cout<<d<<endl;
#define vecp(p) int aa;cin>>aa;(p).push_back(aa);
#define vecpl(p) long long aa;cin>>aa;(p).push_back(aa);
#define vecps(p) string aa;cin>>aa;(p).push_back(aa);
#define vecp2(p) cin>>aa;(p).push_back(aa);
#define vecpl2(p) long long ab;cin>>ab;(p).push_back(ab);
#define vecps2(p) string ab;cin>>ab;(p).push_back(ab);
#define set0(k,n) for(int nn=0;nn<(n);nn++){ (k).push_back(0); }
#define sorts(c) sort((c).begin(),(c).end());
#define reverses(c) reverse((c).begin(),(c).end());
#define vec(b) vector<int> (b);
#define vecl(b) vector<long long> (b);
#define vecs(b) vector<string> (b);
#define vecsize(b,size) vector<int> (b)((size));
#define pb(b,a) (b).push_back((a));
#define doublece(a,b) cout<<(a)<<' '<<(b)<<endl;
#define pairs(s) vector<pair<int,int>> (s);
#define pairsl(s) vector<pair<ll,ll>> (s);
#define pairss(s) vector<pair<string,string>> (s);
#define pairsp(s) int aa,bb;cin>>aa>>bb;(s).push_back(make_pair(aa,bb));
#define pairspl(s) int aa,bb;cin>>aa>>bb;(s).push_back(make_pair(aa,bb));
#define pairsps(s) int aa,bb;cin>>aa>>bb;(s).push_back(make_pair(aa,bb));
#define pairsREV(s) (s).push_back(make_pair(bb,aa));
#define pairslREV(s) (s).push_back(make_pair(bb,aa));
#define pairssREV(s) (s).push_back(make_pair(bb,aa));
#define MOD 1000000007

int gcd(int x,int y){
	
	if(x%y==0){
		return y;
	}else{
		return gcd(y,x%y);
	}
	
}


int main() {
	
	int N,K;
	cin>>N>>K;

	int s=0;
	vec(T)
      
    fx(N){
      vecp(T)
    }
      
	fx(N){
		s+=T.at(x);
		if(x>=2){
			if(s<K){
				ce(x+1)
				return 0;
			}
			s-=T.at(x-2);
		}
		
	}
	ce("-1")
}

Submission Info

Submission Time
Task A - ぐっすり
User monochro
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1970 Byte
Status AC
Exec Time 26 ms
Memory 892 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 20 ms 892 KB
subtask1_02.txt AC 7 ms 512 KB
subtask1_03.txt AC 6 ms 512 KB
subtask1_04.txt AC 4 ms 384 KB
subtask1_05.txt AC 17 ms 892 KB
subtask1_06.txt AC 12 ms 640 KB
subtask1_07.txt AC 17 ms 892 KB
subtask1_08.txt AC 6 ms 512 KB
subtask1_09.txt AC 21 ms 892 KB
subtask1_10.txt AC 19 ms 892 KB
subtask1_11.txt AC 3 ms 256 KB
subtask1_12.txt AC 17 ms 892 KB
subtask1_13.txt AC 22 ms 892 KB
subtask1_14.txt AC 12 ms 640 KB
subtask1_15.txt AC 24 ms 892 KB
subtask1_16.txt AC 26 ms 892 KB
subtask1_17.txt AC 24 ms 892 KB
subtask1_18.txt AC 24 ms 892 KB
subtask1_19.txt AC 24 ms 892 KB
subtask1_20.txt AC 24 ms 892 KB
subtask1_21.txt AC 24 ms 892 KB
subtask1_22.txt AC 24 ms 892 KB
subtask1_23.txt AC 24 ms 892 KB
subtask1_24.txt AC 25 ms 892 KB
subtask1_25.txt AC 24 ms 892 KB
subtask1_26.txt AC 24 ms 892 KB
subtask1_27.txt AC 24 ms 892 KB
subtask1_28.txt AC 24 ms 892 KB
subtask1_29.txt AC 24 ms 892 KB
subtask1_30.txt AC 23 ms 892 KB
subtask1_31.txt AC 23 ms 892 KB