Submission #723712

#TimeUsernameProblemLanguageResultExecution timeMemory
723712vjudge1Catfish Farm (IOI22_fish)C++17
0 / 100
25 ms3564 KiB
#include "fish.h" #include<bits/stdc++.h> #define ll long long #include <vector> ll mx(ll a,ll b){ if(a>b) return a; return b; } long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,std::vector<int> W) { ll dp[N],a[N]; for(int i=0;i<N;i++){ dp[i]=a[i]=0; } for(int i=0;i<M;i++){ a[X[i]]=W[i]; } dp[0]=a[0]; ll ans=dp[0]; dp[1]=mx(a[0],a[1]); ans=mx(ans,dp[1]); for(int i=2;i<N;i++){ dp[i]=mx(dp[i-1],dp[i-2]+a[i]); ans=mx(ans,dp[i]); } 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...