Submission #849976

#TimeUsernameProblemLanguageResultExecution timeMemory
849976Ahmed57Uplifting Excursion (BOI22_vault)C++17
5 / 100
5054 ms16496 KiB
#include <bits/stdc++.h> using namespace std; long long dp[2][505000*2+1],arr[301],br = 505000,n,m; signed main(){ ios_base::sync_with_stdio(false);cin.tie(0); cin>>m>>n; for(int i = 0;i<2*m+1;i++){ cin>>arr[i]; } for(int i = 2*m+1;i>=0;i--){ for(int j = 0;j<=505000*2;j++){ if(i==2*m+1){ if(j==n+br){ dp[i&1][j] = 0; }else{ dp[i&1][j] = -1e18; } continue; } long long ans = -1e18; for(int e = 0;e<=arr[i];e++){ if(j+e*(i-m)<0||j+e*(i-m)>505000*2)continue; ans = max(ans,dp[!(i&1)][j+e*(i-m)]+e); } dp[i&1][j] = ans; } } long long vl = dp[0][505000]; if(vl<0)cout<<"impossible\n"; else cout<<vl<<endl; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...