제출 #1221847

#제출 시각아이디문제언어결과실행 시간메모리
1221847laurra메기 농장 (IOI22_fish)C++20
9 / 100
16 ms4936 KiB
#include "fish.h" #include <vector> using namespace std; #define dim 100005 long long v[dim],dp[dim][2]; long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) { long long i; for(i=0;i<M;i++) v[X[i]]=W[i]; for(i=1;i<N;i++) { dp[i][0]=max(dp[i-1][1]+v[i],dp[i-1][0]); dp[i][1]=max(dp[i-1][1],dp[i-1][0]); if(i>=2) { dp[i][1]=max(dp[i][1],dp[i-2][0]+v[i-1]); } else { dp[i][1]=max(dp[i][1],v[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...