Submission #1068267

#TimeUsernameProblemLanguageResultExecution timeMemory
1068267UnforgettableplCatfish Farm (IOI22_fish)C++17
9 / 100
41 ms10588 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){
    vector<long long> arr(N+1);
    vector DP(N+1,vector(2,0ll));
    for(int i=0;i<M;i++) {
        arr[X[i]+1]=W[i];
    }
    for(int i=2;i<=N;i++) {
        DP[i][0]=max(DP[i-1][0],DP[i-1][1]+arr[i]);
        DP[i][1]=max(DP[i-1][1],max(DP[i-2][1],DP[i-2][0])+arr[i-1]);
    }
    return max(DP[N][0],DP[N][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...