제출 #1132365

#제출 시각아이디문제언어결과실행 시간메모리
1132365vladiliusBali Sculptures (APIO15_sculpture)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define pb push_back
#define ff first
#define ss second
const int inf = 1e9;
const int lg = 60;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n, l, r; cin>>n>>l>>r;
    vector<int> a(n + 1);
    vector<ll> p(n + 1);
    for (int i = 1; i <= n; i++){
        cin>>a[i];
        p[i] = p[i - 1] + a[i];
    }
    vector<pii> all;
    ll out = 0;
    for (int b = lg; b >= 0; b--){
        all.pb({b, 0});
        vector<int> dp(n + 1, inf); dp[0] = 0;
        for (int i = 1; i <= n; i++){
            for (int j = 1; j <= i; j++){
                ll s = p[i] - p[j - 1];
                bool ind = 1;
                for (auto [bb, vv]: all){
                    if (((s >> bb) & 1) != vv){
                        ind = 0;
                        break;
                    }
                }
                if (ind){
                    dp[i] = min(dp[i], dp[j - 1] + 1);
                }
            }
        }
        if (dp[n] > r){
            all.back().ss = 1;
            out += (1LL << b);
        }
    }
    cout<<out<<"\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...