Submission #1353775

#TimeUsernameProblemLanguageResultExecution timeMemory
1353775marizaLawn Mower (CEOI25_lawnmower)C++20
25 / 100
450 ms1114112 KiB
#include "lawn.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

long long mow(int n, int c, int b, vector<int> &a, vector<int> &v){
    ll ans[n+1][c];
    ans[n][0]=0;
    for(ll i=1; i<c; i++){
        ans[n][i]=b;
    }

    for(ll i=n-1; i>=0; i--){
        for(ll j=0; j<c; j++){
            if((v[i]+j)%c==0){
                ans[i][j]=ans[i+1][0]+((v[i]+j)/c)*(a[i]+b);
            }
            else{
                ans[i][j]=min(ans[i+1][(v[i]+j)%c]+((v[i]+j)/c)*(a[i]+b)+a[i],ans[i+1][0]+((v[i]+j)/c+1)*(a[i]+b));
            }
        }
    }

    // for(ll j=0; j<c; j++){
    //     for(ll i=0; i<=n; i++){
    //         cout<<ans[i][j]<<" ";
    //     }
    //     cout<<endl;
    // }

    return ans[0][0];
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...