Submission #1177821

#TimeUsernameProblemLanguageResultExecution timeMemory
1177821PagodePaivaCatfish Farm (IOI22_fish)C++20
9 / 100
17 ms4936 KiB
#include "fish.h" #include<bits/stdc++.h> #define ll long long using namespace std; const int N = 100010; ll mat[N]; ll dp[N][2]; long long max_weights(int n, int m, std::vector<int> X, std::vector<int> Y, std::vector<int> W) { for(int i = 0;i < m;i++){ mat[X[i]+1] = W[i]; } dp[0][0] = dp[0][1] = 0; dp[1][0] = 0; dp[1][1] = mat[1]; for(int i = 2;i < N;i++){ dp[i][0] = max(dp[i-1][1], dp[i-2][1]+mat[i]); dp[i][1] = max(dp[i-1][1], dp[i-1][0]+mat[i]); } return dp[n][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...