Submission #1325238

#TimeUsernameProblemLanguageResultExecution timeMemory
1325238eri16Catfish Farm (IOI22_fish)C++20
0 / 100
13 ms3136 KiB
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W){
    
    vector <int> w(N,0);
    
    for (int i=0; i<M; i++){w[X[i]]=W[i];}
    
    int dp[N][2];
    
    dp[0][0]=0;
    dp[0][1]=0;
    dp[1][0]=w[1];
    dp[1][1]=w[0];
    
    for (int i=2; i<N; i++){
        dp[i][0]=max(dp[i-1][0],dp[i-1][1]+w[i]);
        
        dp[i][1]=max({dp[i-1][0],dp[i-1][1],dp[i-2][0]+w[i-1]});
    }
    
    return max(dp[N-1][0],dp[N-1][1]);
}
#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...