This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;
void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#define int long long
typedef pair<int, int> T;
const int oo = 1e18, oo2 = 1e9+7, K = 42;
const int mod = 998244353;
void solve(){
int n, A, B; cin >> n >> A >> B;
vector<int>a(n+1), pref(n+1);
for (int i = 1; i<=n; i++) {
cin >> a[i];
pref[i] = pref[i-1] + a[i];
}
// if (A == 1){
//A = 1
int mask = (1ll<<(K+1))-1;
auto check = [&](){
vector<int>dp(n+1, oo), dp2(n+1, -oo);
dp[0] = 0;
dp2[0] = 0;
for (int i = 1; i<=n; i++){
for (int j = 1; j<=i; j++){
//[j, i]
int s = pref[i] - pref[j-1];
if ((s|mask) == mask) {
dp[i] = min(dp[i], dp[j-1]+1);
dp2[i] = max(dp2[i], dp2[j-1]+1);
}
}
}
return T{dp[n], dp2[n]};
};
for (int b = K; b >= 0; b--){
mask -= (1ll<<b);
auto [mn, mx] = check();
if (mn > B || mx < A) mask += (1ll<<b);
}
cout << mask << "\n";
return;
// }
//n <= 100, A dowolne
}
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
//cin >> t;
while (t--) solve();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |