Submission #626738

#TimeUsernameProblemLanguageResultExecution timeMemory
626738moyindavidCatfish Farm (IOI22_fish)C++17
0 / 100
23 ms2792 KiB
#include "fish.h"

#include <bits/stdc++.h>
using namespace std;

long long max_weights(int N, int M, vector<int> X, vector<int> Y,vector<int> W) {
    long long dp[N];
    dp[N-1]=0;
    dp[N-2] = max(W[N-1],W[N-2]);
    for(int i=N-3;i>=0;i--){
        long long a=-1;
        if(i<N-3)a=W[i+1]+W[i+2];
        if(i<N-4)a+=dp[i+4];
        dp[i]=max(max(dp[i+1],a),W[i]+dp[i+2]);
    }
    return dp[0];
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...