171122025-05-23 17:06:42ercseferencMaximális szorzat (50 pont)cpp17Time limit exceeded 48/50600ms808 KiB
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,b; long long k; //ifstream f("szamok.txt");
    cin>>n>>k>>b; vector<int>a(n);
    for(int i=0; i<n; i++)cin>>a[i];
    sort(a.begin(),a.end());
    if(b!=0 && a[b-1]>=0){cout<<-1; return 0;}
    long long s=0,t=b;
    if(n!=b){
        while(k>s+(a[t]-a[t-1])*(t-b) && t<n){
            s+=(a[t]-a[t-1])*(t-b);
            t++;}
        for(int i=b; i<t; i++)a[i]=a[t-1];
        k-=s;
        for(int i=b; i<t; i++)a[i]+=k/(t-b);
        k=k%(t-b);
        for(int i=b; i<b+k; i++)a[i]++;
        if(a[b]<0){cout<<-1; return 0;}}
    else{
        for(int i=0; i<k; i++){
            a[0]++; int r=0;
            while(a[r]>a[r+1]){swap(a[r],a[r+1]); r++;}}
        if(a[n-1]>=0){cout<<-1; return 0;}}
    s=1; int mod=1000000007;
    for(int i=0; i<n; i++)s=(s*a[i])%mod;
    cout<<s;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base48/50
1Accepted0/01ms508 KiB
2Accepted0/01ms316 KiB
3Accepted0/01ms512 KiB
4Accepted0/01ms316 KiB
5Accepted0/04ms508 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms508 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/24ms436 KiB
11Accepted2/254ms796 KiB
12Accepted1/157ms808 KiB
13Accepted1/11ms508 KiB
14Accepted1/14ms316 KiB
15Accepted1/120ms748 KiB
16Accepted1/121ms564 KiB
17Accepted1/120ms564 KiB
18Accepted1/110ms608 KiB
19Accepted1/1175ms808 KiB
20Time limit exceeded0/1600ms564 KiB
21Accepted1/161ms564 KiB
22Time limit exceeded0/1580ms748 KiB
23Accepted1/159ms568 KiB
24Accepted1/157ms564 KiB
25Accepted2/21ms316 KiB
26Accepted2/24ms436 KiB
27Accepted2/230ms564 KiB
28Accepted1/130ms564 KiB
29Accepted2/223ms564 KiB
30Accepted1/161ms564 KiB
31Accepted1/143ms564 KiB
32Accepted2/21ms316 KiB
33Accepted2/261ms564 KiB
34Accepted1/161ms564 KiB
35Accepted2/261ms564 KiB
36Accepted2/261ms564 KiB
37Accepted2/261ms808 KiB
38Accepted2/261ms568 KiB
39Accepted1/11ms508 KiB