Submission #83449

#TimeUsernameProblemLanguageResultExecution timeMemory
83449QlukvaBali Sculptures (APIO15_sculpture)C++14
46 / 100
1092 ms54496 KiB
#include <iostream> #include <algorithm> #include <vector> #include <set> using namespace std; const long long INF = 1e15; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, a, b; cin >> n >> a >> b; vector<long long> x(n + 1); for (int i = 1; i <= n; i++) { cin >> x[i]; } vector<vector<set<long long>>> d(b + 1, vector<set<long long>>(n + 1)); d[0][0].insert(0); for (int j = 1; j <= b; j++) { for (int i = 1; i <= n; i++) { long long cur = x[i]; for (int k = i - 1; k >= 0; k--) { for (auto &x : d[j - 1][k]) { d[j][i].insert(cur | x); } cur += x[k]; } } } long long ans = INF; for (int i = a; i <= b; i++) { ans = min(ans, *d[i][n].begin()); } 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...