Submission #920489

#TimeUsernameProblemLanguageResultExecution timeMemory
920489aykhnBali Sculptures (APIO15_sculpture)C++17
21 / 100
1 ms600 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define inf 0x3F3F3F3F const int mod = 1e9 + 7; const int MXN = 2e3 + 5; int n, A, B; int a[MXN]; int _1() { int x = 0, y = (1LL << 31) - 1; for (int b = 30; b >= 0; b--) { vector<int> dp(n + 1, inf); dp[0] = 0; x |= (1LL << b); for (int i = 1; i <= n; i++) { int s = 0; for (int j = i; j >= 1; j--) { s += a[j]; if ((s & x)) continue; dp[i] = min(dp[i], dp[j - 1] + 1); } } if (dp[n] > B) x ^= (1LL << b); } return y - x; } int _2() { return 0; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> A >> B; for (int i = 1; i <= n; i++) cin >> a[i]; cout << (A == 1 ? _1() : _2()) << '\n'; }
#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...