Submission #602861

#TimeUsernameProblemLanguageResultExecution timeMemory
602861FidanBali Sculptures (APIO15_sculpture)C++17
0 / 100
1 ms296 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const ll inf=(1e18)+10; int main(){ ll n, a, b, i, j, h; cin>>n>>a>>b; vector<ll> v(n+1, 0); for(i=1; i<=n; i++){ cin>>v[i]; } vector<vector<ll>> dp(n+1, vector<ll>(b+1, inf)); vector<ll> pre(n+1, 0); for(i=1; i<=n; i++){ pre[i]=pre[i-1]+v[i]; } for(i=1; i<=n; i++){ dp[i][1]=pre[i]; } for(i=1; i<=n; i++){ for(j=1; j<=b; j++){ for(h=1; h<=i; h++){ if(dp[h][j-1]==inf) continue; dp[i][j]=min(dp[i][j], (dp[h][j-1] | (pre[i]-pre[h]))); } } } cout<<dp[n][b]; return 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...