Submission #1335895

#TimeUsernameProblemLanguageResultExecution timeMemory
1335895yc11Catfish Farm (IOI22_fish)C++20
0 / 100
13 ms3660 KiB
#include<bits/stdc++.h>
using namespace std;
int64_t max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W){
    vector<int64_t> dp;
    dp.assign(N,0);
    vector<int64_t> n1;
    n1.resize(N);
    for (int i = 0 ;i<M;i++){
        n1[X[i]] = W[i];
    }
    for (int i = 0;i<N;i++){
        if (i==0) dp[0] = n1[0];
        else if (i==1) dp[1] = max(n1[1],n1[0]);
        else dp[i] = max(dp[i-1],dp[i-2]+n1[i]);
    }
    return dp[N];
    }
#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...