150042025-02-11 07:13:08BencuLeggyorsabb pénzkeresés (50)cpp17Time limit exceeded 44/50252ms792 KiB
#include <bits/stdc++.h>

using namespace std;
int n,p,a[100001],m=INT_MAX;

int main()
{
    ifstream f("be.in");
    //f>>n>>p;
    cin>>n>>p;
    for (int i=1; i<=n; i++) {
        //f>>a[i];
        cin>>a[i];
    }
    for (int i=1; i<=n; i++) {
        int s=a[i],j=i,t=1;
        //cout<<i<<":"<<s<<" ";
        while (s<p && j<n) {
            j++;
            s=s+a[j];
            //cout<<s<<" ";
            t++;
        }
        //cout<<endl;
        if (t<m && s>=p) m=t;
    }
    cout<<m;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base44/50
1Accepted0/01ms316 KiB
2Time limit exceeded0/0241ms564 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms500 KiB
5Accepted2/21ms316 KiB
6Accepted2/27ms500 KiB
7Accepted2/217ms452 KiB
8Accepted2/223ms316 KiB
9Accepted2/27ms420 KiB
10Accepted2/219ms416 KiB
11Accepted2/230ms712 KiB
12Time limit exceeded0/2252ms792 KiB
13Accepted2/2179ms564 KiB
14Accepted2/271ms568 KiB
15Accepted2/2174ms564 KiB
16Accepted2/268ms564 KiB
17Accepted2/261ms788 KiB
18Accepted2/287ms612 KiB
19Time limit exceeded0/2216ms568 KiB
20Accepted2/2148ms564 KiB
21Accepted2/296ms748 KiB
22Accepted2/2127ms564 KiB
23Time limit exceeded0/2244ms564 KiB
24Accepted2/2123ms564 KiB
25Accepted2/2155ms592 KiB
26Accepted2/293ms564 KiB
27Accepted2/290ms564 KiB