oj.uz

Submission #145999

# Submission time Handle Problem Language Result Execution time Memory
145999 2019-08-21T14:23:25 Z str0ct Bali Sculptures (APIO15_sculpture) C++14
21 / 100
 34 ms 636 KB 
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
ll N,A,B;
ll arr[2020];
ll ans;
ll dp2[105][105];
void sol2(){
    ll k=60;
    ans=(1LL<<k)-1;
    k--;
    ll dp[2020];
    while(k>=0){
        ans-=(1LL<<k);
        fill(dp+1,dp+2020,10101010);
        dp[0]=0;
        for(ll i=1;i<=N;i++){
            for(ll j=0;j<i;j++)if(((arr[i]-arr[j])|ans)==ans)dp[i]=min(dp[i],dp[j]+1);
        }
        if(dp[N]>B)ans+=(1<<k);
        k--;
    }
}
void sol1(){
    ll k=60;
    ans=(1LL<<k)-1;
    k--;
    while(k>=0){
        for(int i=0;i<105;i++)for(int j=0;j<105;j++)dp2[i][j]=0;
        dp2[0][0]=1;
        ans-=(1LL<<k);
        for(ll i=1;i<=N;i++)
            for(ll j=1;j<=i;j++)
                for(ll p=0;p<i;p++)
                    if(dp2[p][j-1]&&((arr[i]-arr[p])|ans)==ans)dp2[i][j]=1;
        ll flag=0;
        for(ll i=A;i<=B;i++){
            if(dp2[N][i]){
                flag=1;
                break;
            }
        }
        if(flag==0)ans+=(1LL<<k);
        k--;
    }
}
int main(){
    scanf("%lld%lld%lld",&N,&A,&B);
    for(ll i=1;i<=N;i++){
        scanf("%lld",arr+i);
        arr[i]+=arr[i-1];
    }
    if(A==1)sol1();
    else sol2();
    printf("%lld",ans);
}

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:48:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld%lld%lld",&N,&A,&B);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:50:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld",arr+i);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 392 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Incorrect 2 ms 376 KB Output isn't correct
16 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 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Incorrect 2 ms 256 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 380 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 6 ms 448 KB Output is correct
18 Correct 7 ms 376 KB Output is correct
19 Correct 7 ms 376 KB Output is correct
20 Correct 7 ms 376 KB Output is correct
21 Correct 7 ms 504 KB Output is correct
22 Correct 7 ms 376 KB Output is correct
23 Correct 7 ms 376 KB Output is correct
24 Correct 7 ms 376 KB Output is correct
25 Correct 13 ms 376 KB Output is correct
26 Correct 19 ms 448 KB Output is correct
27 Correct 26 ms 348 KB Output is correct
28 Correct 33 ms 444 KB Output is correct
29 Correct 33 ms 504 KB Output is correct
30 Correct 34 ms 504 KB Output is correct
31 Correct 33 ms 444 KB Output is correct
32 Correct 34 ms 476 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 1 ms 348 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Incorrect 2 ms 376 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 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 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 3 ms 352 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 7 ms 376 KB Output is correct
29 Correct 7 ms 376 KB Output is correct
30 Correct 7 ms 376 KB Output is correct
31 Correct 7 ms 376 KB Output is correct
32 Correct 9 ms 376 KB Output is correct
33 Correct 8 ms 480 KB Output is correct
34 Correct 8 ms 376 KB Output is correct
35 Correct 12 ms 376 KB Output is correct
36 Correct 18 ms 376 KB Output is correct
37 Correct 27 ms 376 KB Output is correct
38 Correct 34 ms 376 KB Output is correct
39 Correct 33 ms 376 KB Output is correct
40 Correct 34 ms 376 KB Output is correct
41 Correct 33 ms 376 KB Output is correct
42 Correct 33 ms 376 KB Output is correct
43 Correct 7 ms 376 KB Output is correct
44 Correct 18 ms 376 KB Output is correct
45 Correct 25 ms 376 KB Output is correct
46 Correct 31 ms 376 KB Output is correct
47 Correct 33 ms 376 KB Output is correct
48 Correct 31 ms 376 KB Output is correct
49 Correct 31 ms 376 KB Output is correct
50 Correct 32 ms 376 KB Output is correct
51 Correct 33 ms 376 KB Output is correct
52 Runtime error 4 ms 636 KB Execution killed with signal 11 (could be triggered by violating memory limits)
53 Halted 0 ms 0 KB -