Submission #1043176

#TimeUsernameProblemLanguageResultExecution timeMemory
1043176ezzzayCatfish Farm (IOI22_fish)C++17
0 / 100
13 ms5720 KiB
#include "fish.h" #include<bits/stdc++.h> using namespace std; #include <vector> #define ll long long const int MN=1e6; ll a[MN]; ll dp[MN][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++){ a[X[i]]+=W[i]; } dp[0][1]=a[0]; dp[0][0]=0; for(int i=2;i<=N;i++){ dp[i][1]=max(dp[i-1][0]+a[i],dp[i][1]); dp[i+1][0]=max(dp[i+1][0],max(dp[i-1][0],dp[i-1][1])+a[i]); dp[i][0]=max(dp[i-1][0],dp[i-1][1]); } return max(dp[N][0],dp[N][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...