236072026-01-26 09:57:31szentedLeggyorsabb pénzkeresés (50)cpp17Time limit exceeded 44/50236ms788 KiB
#include <iostream>

using namespace std;

int main()
{
    int n;
    int p;
    int a[100000];
    cin >> n;
    cin >> p;
    for(int i=0; i<n; i++){
        cin >> a[i];
    }

    int s=0;
    int mini_napok=n;
    int j=0;
    int napok=0;

    for(int i=0; i<n; i++){
        napok=0;
        j=i;
        s=0;
        while(s<p && j<n){
            s=s+a[j];
            j++;
        }
        napok=j-i;
        if(napok<mini_napok && s>=p) mini_napok=napok;
    }
    cout << mini_napok;

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base44/50
1Accepted0/01ms316 KiB
2Time limit exceeded0/0225ms564 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms500 KiB
5Accepted2/21ms316 KiB
6Accepted2/27ms448 KiB
7Accepted2/217ms444 KiB
8Accepted2/221ms448 KiB
9Accepted2/26ms500 KiB
10Accepted2/218ms316 KiB
11Accepted2/228ms688 KiB
12Time limit exceeded0/2236ms644 KiB
13Accepted2/2166ms564 KiB
14Accepted2/267ms708 KiB
15Accepted2/2164ms564 KiB
16Accepted2/268ms564 KiB
17Accepted2/259ms788 KiB
18Accepted2/282ms564 KiB
19Time limit exceeded0/2202ms568 KiB
20Accepted2/2138ms564 KiB
21Accepted2/290ms576 KiB
22Accepted2/2119ms564 KiB
23Time limit exceeded0/2228ms564 KiB
24Accepted2/2115ms584 KiB
25Accepted2/2144ms564 KiB
26Accepted2/286ms564 KiB
27Accepted2/286ms564 KiB