Submission #1237707

#TimeUsernameProblemLanguageResultExecution timeMemory
1237707tin_leBali Sculptures (APIO15_sculpture)C++20
21 / 100
1 ms328 KiB
#include<bits/stdc++.h> using namespace std; using ll = long long; using vi = vector<int>; using vll = vector<ll>; using vvll = vector<vll>; #define INF 1e18 void solve() { int n, l, r; cin >> n >> l >> r; vll a(n); for(auto& x : a) cin >> x; vvll dp(n, vll(r + 1, -1)); auto dfs = [&](auto& dfs, int i = 0, int g = 0) -> ll { if(g > r) return INF; if(i == n) return g >= l ? 0 : INF; auto& res = dp[i][g]; if(res != -1) return res; res = INF; ll x = 0; for(int j = i; j < n; j++) { x += a[j]; auto nxt = dfs(dfs, j + 1, g + 1); if(nxt != INF) { res = min(res, x | nxt); } } return res; }; cout << dfs(dfs) << '\n'; } signed main() { int t = 1; for(int i = 1; i <= t; i++) { solve(); } 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...