Submission #1043180

#TimeUsernameProblemLanguageResultExecution timeMemory
1043180ezzzayCatfish Farm (IOI22_fish)C++17
3 / 100
53 ms11092 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; ll ans=a[0]; for(int i=1;i<=N+5;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]); ans=max(ans,dp[i][1]); ans=max(ans,dp[i+1][0]); ans=max(ans,dp[i][0]); } return ans; }
#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...