oj.uz

Submission #882724

# Submission time Handle Problem Language Result Execution time Memory
882724 2023-12-03T14:34:43 Z vjudge1 Bali Sculptures (APIO15_sculpture) C++17
0 / 100
 1 ms 436 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define endl "\n"
#define all(aa) aa.begin(), aa.end()

int main(){
    ll n, a, b;
    cin>>n>>a>>b;

    vector<ll> v(n);
    for(auto &e:v) cin>>e;

    ll cur=0;
    for(ll i=60; i>=0; i--){
        cur*=2;
        vector<vector<bool>> dp(n, vector<bool>(b+1, 0));

        for(ll j=n-1; j>=0; j--){
            for(ll k=0; k<=b; k++){
                ll s=0;
                for(ll x=j; x<n; x++){
                    s+=v[x];

                    bool f=1;
                    ll tmp=s>>i, tmp2=cur;
                    while(tmp || tmp2){
                        if(tmp%2 && !(tmp2%2)) f=0;
                        tmp/=2;
                        tmp2/=2;
                    }

                    if(f && (x==n-1 || (k>0 && dp[x+1][k-1]))) dp[j][k]=1;
                }
            }
        }

        bool f=1;
        for(ll j=a; j<=b; j++)
            f&=(!dp[0][j]);

        if(f) cur++;
    }

    cout<<cur<<endl;

}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 428 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 436 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 436 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Incorrect 1 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -