Submission #1079784

#TimeUsernameProblemLanguageResultExecution timeMemory
1079784LeaRouseCatfish Farm (IOI22_fish)C++17
0 / 100
49 ms15380 KiB
#include <bits/stdc++.h> #include "fish.h" #define fastio ios_base::sync_with_stdio(0); cin.tie(0); #define ll long long using namespace std; const int MAX=1e5+5; int nn; ll A[MAX]; ll dp[MAX][5]; ll Dp(int ind,int awa){ if(ind==nn){ return 0LL; } if(dp[ind][awa]!=-1){ return dp[ind][awa]; } dp[ind][awa]=Dp(ind+1,0); if(awa==0){ dp[ind][awa]=max(dp[ind][awa],Dp(ind+1,1)+A[ind]); } else{ if(ind==nn-1) return dp[ind][awa]; else{ dp[ind][awa]=max(dp[ind][awa],Dp(ind+2,0)+A[ind]); } } return dp[ind][awa]; } ll max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w){ nn=n; for(int i=0;i<m;i++){ A[x[i]]=w[i]; } for(int i=0;i<MAX;i++){ dp[i][0]=-1; dp[i][1]=-1; } return Dp(0,0); }
#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...