oj.uz

Submission #126396

# Submission time Handle Problem Language Result Execution time Memory
126396 2019-07-07T15:24:56 Z The_Wolfpack Bali Sculptures (APIO15_sculpture) C++14
50 / 100
 85 ms 504 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;

const int NMAX=2007;

int n,a,b;
int dp[NMAX];
int dp1[105][105];
ll y[NMAX],parc[NMAX];

int main()
{
    ios_base::sync_with_stdio(false);
    cin>>n>>a>>b;
    for(int i=0;i<n;i++) cin>>y[i];
    parc[0]=y[0];
    for(int i=1;i<n;i++) parc[i]=parc[i-1]+y[i];
    if(a==1)
    {
        ll res=0;
        for(int i=40;i>=0;i--)
        {
            ll cur=res | (1ll<<i);
            for(int j=0;j<=n;j++) dp[j]=n+1;
            dp[0]=0;
            for(int j=0;j<n;j++)
            {
                ll sum=0;
                for(int k=j;k<n;k++)
                {
                    sum+=y[k];
                    if((sum&cur)==0) dp[k+1]=min(dp[k+1],dp[j]+1);
                }
            }
            if(dp[n]<=b) res+=(1ll<<i);
        }

    cout<<(1ll<<41)-1-res<<endl;
    }
    else
    {
        ll res=0;
        for(int i=40;i>=0;i--)
        {
            ll cur=res|(1ll<<i);
            memset(dp1,0,sizeof(dp1));
            for(int t=0;t<=n;t++) if((cur&parc[t])==0) dp1[t][1]=1;
            for(int t=2;t<=n;t++)
            {
                for(int j=0;j<n;j++)
                {
                    ll sum=0;
                    for(int k=j;k<n;k++)
                    {
                        sum+=y[k];
                        if((cur&sum)==0 && dp1[j][t-1]) dp1[k+1][t]=1;
                    }
                }
            }
            for(int t=a;t<=b;t++)
            {
                if(dp1[n][t])
                {
                    res+=(1ll<<i);
                    break;
                }
            }
        }
    cout<<(1ll<<41)-1-res<<endl;
    }
    return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Incorrect 2 ms 376 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Incorrect 2 ms 376 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 380 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 380 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 372 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Incorrect 2 ms 376 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 304 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 380 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 2 ms 376 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 2 ms 376 KB Output is correct
46 Correct 2 ms 376 KB Output is correct
47 Correct 2 ms 380 KB Output is correct
48 Correct 2 ms 376 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 2 ms 376 KB Output is correct
52 Correct 9 ms 376 KB Output is correct
53 Correct 14 ms 376 KB Output is correct
54 Correct 25 ms 376 KB Output is correct
55 Correct 23 ms 376 KB Output is correct
56 Correct 80 ms 376 KB Output is correct
57 Correct 80 ms 504 KB Output is correct
58 Correct 78 ms 376 KB Output is correct
59 Correct 78 ms 376 KB Output is correct
60 Correct 84 ms 376 KB Output is correct
61 Correct 2 ms 376 KB Output is correct
62 Correct 14 ms 376 KB Output is correct
63 Correct 25 ms 376 KB Output is correct
64 Correct 22 ms 408 KB Output is correct
65 Correct 41 ms 376 KB Output is correct
66 Correct 61 ms 420 KB Output is correct
67 Correct 81 ms 504 KB Output is correct
68 Correct 85 ms 420 KB Output is correct
69 Correct 79 ms 416 KB Output is correct