Submission #1,019

2022-02-24 21:27:45

cpp14

Accepted 50/50

24ms

11532 KiB

#include <bits/stdc++.h>
using namespace std;
#define InTheNameOfGod ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
using ll = long long;

const int maxN = 2e5 + 5;
const int MOD = 1e9 + 7;


int main() {
   InTheNameOfGod;


    ll n,m;
    cin >> n >> m;

    vector<int> v(n);
    for(int &i : v) cin >> i;

    int last = 0, sum = 0, mo = INT_MAX;
    for(int i = 0; i < n; i++) {
        sum += v[i];
        while(sum - v[last] >= m && last < i) {
            sum -= v[last++];
        }

        if(sum >= m) mo = min(mo, i - last + 1);
    }

    cout << mo;

    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	2ms	1736 KiB
		2	Accepted	0/0	10ms	3000 KiB
		3	Accepted	2/2	1ms	2348 KiB
		4	Accepted	2/2	1ms	2356 KiB
		5	Accepted	2/2	1ms	2364 KiB
		6	Accepted	2/2	2ms	2412 KiB
		7	Accepted	2/2	2ms	2456 KiB
		8	Accepted	2/2	2ms	2500 KiB
		9	Accepted	2/2	2ms	2552 KiB
		10	Accepted	2/2	2ms	2604 KiB
		11	Accepted	2/2	14ms	3828 KiB
		12	Accepted	2/2	10ms	4308 KiB
		13	Accepted	2/2	10ms	4788 KiB
		14	Accepted	2/2	12ms	5276 KiB
		15	Accepted	2/2	12ms	5760 KiB
		16	Accepted	2/2	10ms	6240 KiB
		17	Accepted	2/2	10ms	6716 KiB
		18	Accepted	2/2	10ms	7200 KiB
		19	Accepted	2/2	10ms	7688 KiB
		20	Accepted	2/2	10ms	8168 KiB
		21	Accepted	2/2	10ms	8648 KiB
		22	Accepted	2/2	10ms	9124 KiB
		23	Accepted	2/2	10ms	9612 KiB
		24	Accepted	2/2	24ms	10092 KiB
		25	Accepted	2/2	10ms	10572 KiB
		26	Accepted	2/2	12ms	11056 KiB
		27	Accepted	2/2	10ms	11532 KiB