oj.uz

Submission #1110435

# Submission time Handle Problem Language Result Execution time Memory
1110435 2024-11-09T12:47:00 Z simona1230 Bali Sculptures (APIO15_sculpture) C++17
0 / 100
 1 ms 508 KB 
#include <bits/stdc++.h>

using namespace std;

int n,a,b;
int c[2001],p[2001];
int dp[2001][2001];

bool check(int x)
{
    //cout<<"! "<<x<<endl;
    dp[0][0]=1;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            dp[i][j]=0;
            for(int k=0;k<i;k++)
            {
                if(((p[i]-p[k])|x)<=x)
                {
                    //cout<<p[i]-p[k]<<endl;
                    dp[i][j]=max(dp[i][j],dp[k][j-1]);
                }
            }

            //cout<<i<<" "<<j<<" "<<dp[i][j]<<endl;
            if(i==n&&j>=a&&j<=b&&dp[i][j])
            {
                return 1;
            }
        }
    }

    return 0;
}

void read()
{
    cin>>n>>a>>b;
    for(int i=1;i<=n;i++)
    {
        cin>>c[i];
        p[i]=p[i-1]+c[i];
    }
}

void solve()
{
    int ans=0;
    for(int i=3;i>=0;i--)
    {
        int curr=ans;
        for(int j=i-1;j>=0;j--)
            curr+=(1<<j);

        //cout<<curr<<endl;

        if(!check(curr))ans+=(1<<i);
    }

    cout<<ans<<endl;
}


int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	read();
	solve();
	return 0;
}

/*
6 1 3
8 1 2 1 5 4
*/

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 25.0

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

Subtask #5
0 / 29.0

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