Submission #83446

#TimeUsernameProblemLanguageResultExecution timeMemory
83446QlukvaBali Sculptures (APIO15_sculpture)C++14
0 / 100
2 ms644 KiB
#include <iostream> #include <algorithm> #include <vector> using namespace std; const int INF = 1.5e9; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, a, b; cin >> n >> a >> b; vector<int> x(n + 1); for (int i = 1; i <= n; i++) { cin >> x[i]; } vector<vector<int>> d(b + 1, vector<int>(n + 1, INF)); d[0][0] = 0; for (int j = 1; j <= b; j++) { for (int i = 1; i <= n; i++) { int cur = x[i]; for (int k = i - 1; k >= 0; k--) { d[j][i] = min(d[j][i], (d[j - 1][k] | cur)); cur += x[k]; } } } int ans = INF; for (int i = a; i <= b; i++) { ans = min(ans, d[i][n]); } cout << ans << endl; // system("pause"); }
#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...