oj.uz

Submission #1110442

# Submission time Handle Problem Language Result Execution time Memory
1110442 2024-11-09T12:54:45 Z simona1230 Bali Sculptures (APIO15_sculpture) C++17
37 / 100
 52 ms 2640 KB 
#include <bits/stdc++.h>

using namespace std;

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

bool check(long long x)
{
    //cout<<"! "<<x<<endl;
    dp[0][0]=1;
    for(long long i=1;i<=n;i++)
    {
        for(long long j=1;j<=n;j++)
        {
            dp[i][j]=0;
            for(long long k=0;k<i;k++)
            {
                if(p[i]-p[k]>x)continue;
                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(long long i=1;i<=n;i++)
    {
        cin>>c[i];
        p[i]=p[i-1]+c[i];
    }
}

int w[64];
void solve()
{
    w[0]=1;
    for(int i=1;i<=60;i++)
        w[i]=w[i-1]*2;
    long long ans=0;
    for(long long i=60;i>=0;i--)
    {
        long long curr=ans;
        for(long long j=i-1;j>=0;j--)
            curr+=w[j];

        //cout<<curr<<endl;

        if(!check(curr))ans+=w[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 384 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 504 KB Output is correct
6 Correct 2 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 2 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 2 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 1 ms 2384 KB Output is correct
13 Correct 2 ms 2640 KB Output is correct
14 Correct 1 ms 504 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 2384 KB Output is correct
20 Correct 1 ms 2384 KB Output is correct
21 Correct 2 ms 2384 KB Output is correct
22 Correct 2 ms 2384 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2552 KB Output is correct
25 Correct 2 ms 2384 KB Output is correct
26 Correct 1 ms 2384 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 2384 KB Output is correct
30 Incorrect 1 ms 2384 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #2
16.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 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 2 ms 2384 KB Output is correct
8 Correct 2 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 2 ms 2384 KB Output is correct
11 Correct 2 ms 2384 KB Output is correct
12 Correct 2 ms 2384 KB Output is correct
13 Correct 1 ms 2384 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 504 KB Output is correct
19 Correct 1 ms 2384 KB Output is correct
20 Correct 1 ms 2384 KB Output is correct
21 Correct 1 ms 2384 KB Output is correct
22 Correct 1 ms 2384 KB Output is correct
23 Correct 1 ms 2384 KB Output is correct
24 Correct 1 ms 2384 KB Output is correct
25 Correct 2 ms 2384 KB Output is correct
26 Correct 1 ms 2384 KB Output is correct
27 Correct 1 ms 2576 KB Output is correct
28 Correct 2 ms 2384 KB Output is correct
29 Correct 4 ms 2384 KB Output is correct
30 Correct 5 ms 2384 KB Output is correct
31 Correct 7 ms 2384 KB Output is correct
32 Correct 7 ms 2384 KB Output is correct
33 Correct 7 ms 2384 KB Output is correct
34 Correct 7 ms 2432 KB Output is correct
35 Correct 7 ms 2396 KB Output is correct
36 Correct 7 ms 2384 KB Output is correct

Subtask #3
21.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 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 504 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 1 ms 2384 KB Output is correct
13 Correct 1 ms 2384 KB Output is correct
14 Correct 2 ms 2556 KB Output is correct
15 Correct 2 ms 2384 KB Output is correct
16 Correct 3 ms 2384 KB Output is correct
17 Correct 5 ms 2384 KB Output is correct
18 Correct 7 ms 2384 KB Output is correct
19 Correct 7 ms 2384 KB Output is correct
20 Correct 7 ms 2384 KB Output is correct
21 Correct 7 ms 2384 KB Output is correct
22 Correct 8 ms 2384 KB Output is correct
23 Correct 8 ms 2568 KB Output is correct
24 Correct 11 ms 2384 KB Output is correct
25 Correct 14 ms 2552 KB Output is correct
26 Correct 24 ms 2384 KB Output is correct
27 Correct 37 ms 2572 KB Output is correct
28 Correct 52 ms 2556 KB Output is correct
29 Correct 48 ms 2384 KB Output is correct
30 Correct 49 ms 2384 KB Output is correct
31 Correct 49 ms 2384 KB Output is correct
32 Correct 49 ms 2384 KB Output is correct

Subtask #4
0 / 25.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 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 2 ms 2384 KB Output is correct
10 Correct 2 ms 2384 KB Output is correct
11 Correct 1 ms 2552 KB Output is correct
12 Correct 2 ms 2384 KB Output is correct
13 Correct 1 ms 2384 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 2384 KB Output is correct
20 Correct 1 ms 2384 KB Output is correct
21 Correct 1 ms 2384 KB Output is correct
22 Correct 2 ms 2524 KB Output is correct
23 Correct 1 ms 2384 KB Output is correct
24 Correct 1 ms 2384 KB Output is correct
25 Correct 2 ms 2384 KB Output is correct
26 Correct 1 ms 2568 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 2384 KB Output is correct
30 Incorrect 1 ms 2384 KB Output isn't correct
31 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 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 2 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 1 ms 2572 KB Output is correct
13 Correct 2 ms 2552 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 2384 KB Output is correct
17 Incorrect 1 ms 2384 KB Output isn't correct
18 Halted 0 ms 0 KB -