제출 #1192253

#제출 시각아이디문제언어결과실행 시간메모리
1192253lucaskojimaBali Sculptures (APIO15_sculpture)C++17
0 / 100
0 ms328 KiB
// subtask 2 #include "bits/stdc++.h" #define sz(x) (int)size(x) #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) using namespace std; using ll = long long; using pii = pair<int, int>; const char nl = '\n'; const int INF = 0x3f3f3f3f; const ll LINF = 0x3f3f3f3f3f3f3f3f; template<typename T> void chmin(T &a, T b) { if (b < a) a = b; } int32_t main() { ios::sync_with_stdio(0), cin.tie(0); int n, a, b; cin >> n >> a >> b; vector<int> y(n); for (auto &x : y) cin >> x; vector<ll> p(n); p[0] = y[0]; for (int i = 1; i < n; i++) p[i] = p[i - 1] + y[i]; vector dp(n, vector<ll>(b + 1, LINF)); dp[0][1] = y[0]; for (int i = 1; i < n; i++) for (int k = 1; k <= b; k++) for (int j = 0; j < i; j++) chmin(dp[i][k], dp[j][k - 1] | (p[i] - p[j])); ll ans = LINF; for (int i = a; i <= b; i++) chmin(ans, dp[n - 1][i]); cout << ans << nl; 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...