Submission #1190359

#TimeUsernameProblemLanguageResultExecution timeMemory
1190359julia_08Bali Sculptures (APIO15_sculpture)C++20
21 / 100
13 ms1296 KiB
#include <bits/stdc++.h> using namespace std; const int MAXN = 110; int y[MAXN], dp[MAXN][20 * MAXN]; int main(){ cin.tie(0)->sync_with_stdio(0); int n, a, b; cin >> n >> a >> b; int sum = 0; for(int i=1; i<=n; i++){ cin >> y[i]; sum += y[i]; } for(int i=0; i<=n; i++){ for(int j=0; j<=sum; j++){ dp[i][j] = 1e9; } } dp[0][0] = 0; for(int i=0; i<=n; i++){ for(int j=0; j<=sum; j++){ int cur_sum = 0; for(int k=i+1; k<=n; k++){ cur_sum += y[k]; dp[k][j | cur_sum] = min(dp[k][j | cur_sum], dp[i][j] + 1); } } } for(int j=0; j<=sum; j++){ if(dp[n][j] <= b){ cout << j << "\n"; return 0; } } 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...