Submission #626715

#TimeUsernameProblemLanguageResultExecution timeMemory
626715Icebear16Catfish Farm (IOI22_fish)C++17
0 / 100
26 ms3020 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; #define sz(a) a.size() long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W){ int n=N; int dp[n+1][2]; for(int i=0;i<=n;i++){ dp[i][0]=0,dp[i][1]=0; } for(int i=0;i<M;i++){ dp[X[i]+1][0]=W[i]; dp[X[i]+1][1]=W[i]; } dp[2][0]=max(dp[1][0],dp[2][0]); dp[2][1]=max(dp[1][1],dp[2][1]); for(int i=3;i<=n;i++){ dp[i][0]+=max(dp[i-2][0],dp[i-2][1]); dp[i][1]+=dp[i-1][0]; } return max(dp[n][0],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...