Submission #21,830

2026-01-14 08:57:33

cpp17

Wrong answer 46/50

28ms

916 KiB

#include <iostream>

using namespace std;

int main()
{
    ios::sync_with_stdio();
    cin.tie(0);
    cout.tie(0);
    int n,k=0;
    long long p, s=0;
    cin>>n>>p;
    int f[n];
    int mini=n+1;
    for(int i=0; i<n; i++)cin>>f[i];
    for(int i=0; i<n; i++){
        s+=f[i];
        for(k; s-f[k]>=p; k++)
        {
            s-=f[k];
            if(i-k<mini)mini=i-k;
        }
    }
    cout<<mini;
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	46/50
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	27ms	564 KiB
		3	Accepted	2/2	1ms	316 KiB
		4	Accepted	2/2	1ms	316 KiB
		5	Wrong answer	0/2	1ms	316 KiB
		6	Accepted	2/2	3ms	316 KiB
		7	Accepted	2/2	3ms	316 KiB
		8	Accepted	2/2	3ms	432 KiB
		9	Accepted	2/2	3ms	500 KiB
		10	Accepted	2/2	3ms	316 KiB
		11	Accepted	2/2	27ms	684 KiB
		12	Accepted	2/2	27ms	668 KiB
		13	Accepted	2/2	27ms	632 KiB
		14	Accepted	2/2	27ms	624 KiB
		15	Accepted	2/2	27ms	688 KiB
		16	Accepted	2/2	27ms	604 KiB
		17	Accepted	2/2	27ms	756 KiB
		18	Accepted	2/2	27ms	612 KiB
		19	Accepted	2/2	27ms	564 KiB
		20	Accepted	2/2	27ms	664 KiB
		21	Accepted	2/2	27ms	564 KiB
		22	Accepted	2/2	27ms	748 KiB
		23	Wrong answer	0/2	27ms	756 KiB
		24	Accepted	2/2	27ms	916 KiB
		25	Accepted	2/2	27ms	564 KiB
		26	Accepted	2/2	27ms	564 KiB
		27	Accepted	2/2	28ms	568 KiB