237972026-01-29 19:16:33szentedLeggyorsabb pénzkeresés (50)cpp17Time limit exceeded 44/50263ms788 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++;
        }
        if(napok<mini_napok && s>=p) mini_napok=napok;
        if(mini_napok==1) break;
    }
    cout << mini_napok;

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base44/50
1Accepted0/01ms492 KiB
2Time limit exceeded0/0250ms568 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/28ms444 KiB
7Accepted2/217ms316 KiB
8Accepted2/224ms316 KiB
9Accepted2/27ms500 KiB
10Accepted2/220ms316 KiB
11Accepted2/230ms748 KiB
12Time limit exceeded0/2263ms564 KiB
13Accepted2/2185ms564 KiB
14Accepted2/272ms708 KiB
15Accepted2/2181ms568 KiB
16Accepted2/270ms564 KiB
17Accepted2/264ms564 KiB
18Accepted2/292ms568 KiB
19Time limit exceeded0/2224ms728 KiB
20Accepted2/2152ms744 KiB
21Accepted2/298ms564 KiB
22Accepted2/2131ms564 KiB
23Time limit exceeded0/2254ms788 KiB
24Accepted2/2128ms564 KiB
25Accepted2/2160ms624 KiB
26Accepted2/297ms668 KiB
27Accepted2/293ms564 KiB