Submission #989869

#TimeUsernameProblemLanguageResultExecution timeMemory
989869cpdreamerCatfish Farm (IOI22_fish)C++17
9 / 100
18 ms6228 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,std::vector<int> W) { vector<int>vp(N); vp.assign(N,0); for(int i=0;i<M;i++){ vp[X[i]]+=W[i]; } long long dp[N][2]; dp[0][0]=0; dp[0][1]=vp[0]; dp[1][0]=max(vp[1],vp[0]); dp[1][1]=max(vp[1],vp[0]); for(int i=2;i<N;i++){ dp[i][1]=max(dp[i-1][1],dp[i-1][0]+vp[i]); dp[i][0]=max(dp[i-1][1],max(dp[i-2][1]+vp[i],dp[i-2][0]+vp[i-1])); } return dp[N-1][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...