171452025-05-25 18:26:34ercseferencLádapakolás raktárban (50)cpp17Wrong answer 27/50300ms2076 KiB
#include <bits/stdc++.h>
using namespace std;
int n,m,k=0;
void rendez(vector<int>a){
    bool nov,lehet=1,starto; int start=k;
    if(a[k]<a[k+1])nov=1;
    else if(a[k]>a[k+1])nov=0;
    else lehet=0;
    starto=nov;
    int s=0;
    while(lehet && k<n){
        s+=a[k];
        if(s+a[k+1]>m)lehet=0;
        else{
            if(nov && a[k]>a[k+1])nov=0;
            else if(!nov && a[k]<a[k+1])lehet=0;
            if(starto && !nov){
                int t=start;
                while(a[t]<=a[k+1]){
                    if(a[t]==a[k+1])lehet=0;
                    t++;}}
            if(lehet)k++;}}
    k++;}
int main()
{
    //ifstream f("szamok.txt");
    cin>>n>>m;
    vector<int>a(n); int t=0;
    for(int i=0; i<n; i++)cin>>a[i];
    while(k<n){rendez(a); t++;}
    cout<<n-t;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base27/50
1Accepted0/01ms316 KiB
2Wrong answer0/012ms316 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms508 KiB
6Accepted2/21ms508 KiB
7Accepted2/21ms500 KiB
8Accepted2/21ms316 KiB
9Accepted3/31ms316 KiB
10Accepted2/21ms316 KiB
11Accepted2/21ms316 KiB
12Accepted2/22ms316 KiB
13Accepted3/34ms444 KiB
14Wrong answer0/39ms316 KiB
15Accepted3/313ms536 KiB
16Time limit exceeded0/2300ms1560 KiB
17Time limit exceeded0/3300ms1800 KiB
18Time limit exceeded0/3300ms2076 KiB
19Runtime error0/3142ms1544 KiB
20Time limit exceeded0/3287ms1548 KiB
21Time limit exceeded0/3282ms1552 KiB
22Runtime error0/3136ms1668 KiB