oj.uz

Submission #404963

# Submission time Handle Problem Language Result Execution time Memory
404963 2021-05-15T12:19:31 Z Hazem Bali Sculptures (APIO15_sculpture) C++14
50 / 100
 142 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define LL long long
#define F first
#define S second
#define pii pair<int,int>
#define piii pair<pair<int,int>,int>

const int N = 2e5+10;
const int M = 200;
const LL INF = 1e9;
const LL LINF = 2e18;
const LL MOD = 1e9+7;   
const double PI = 3.141592653589793;

LL a[N],dp[N];
int n,l,r;

bool check1(LL val){

    dp[0] = 0;
    for(int i=1;i<=n;i++){
        dp[i] = LINF;
        LL sum = 0;
        for(int j=i;j>=1;j--){
            sum += a[j];
            if((sum&val)==sum)
                dp[i] = min(dp[i],dp[j-1]+1);
        }
    }
    return dp[n]<=r;
}

int main(){

    //freopen("out.txt","w",stdout);

    scanf("%d%d%d",&n,&l,&r);

    for(int i=1;i<=n;i++)
        scanf("%lld",&a[i]);

    LL ans = (1ll<<45)-1;
    for(LL i=44;i>=0;i--){
        ans ^= 1ll<<i;
        if(!check1(ans))ans ^= 1ll<<i;
    }
    printf("%lld\n",ans);
}

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:39:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |     scanf("%d%d%d",&n,&l,&r);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
sculpture.cpp:42:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |         scanf("%lld",&a[i]);
      |         ~~~~~^~~~~~~~~~~~~~

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Incorrect 1 ms 204 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 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 2 ms 296 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 2 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 2 ms 304 KB Output is correct
28 Correct 2 ms 204 KB Output is correct
29 Correct 2 ms 204 KB Output is correct
30 Correct 2 ms 204 KB Output is correct
31 Correct 2 ms 300 KB Output is correct
32 Correct 2 ms 204 KB Output is correct

Subtask #4
0 / 25.0

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

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 296 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 3 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 236 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 216 KB Output is correct
31 Correct 1 ms 216 KB Output is correct
32 Correct 1 ms 308 KB Output is correct
33 Correct 1 ms 216 KB Output is correct
34 Correct 1 ms 216 KB Output is correct
35 Correct 2 ms 216 KB Output is correct
36 Correct 1 ms 216 KB Output is correct
37 Correct 2 ms 216 KB Output is correct
38 Correct 2 ms 216 KB Output is correct
39 Correct 2 ms 216 KB Output is correct
40 Correct 2 ms 216 KB Output is correct
41 Correct 3 ms 216 KB Output is correct
42 Correct 2 ms 308 KB Output is correct
43 Correct 1 ms 216 KB Output is correct
44 Correct 1 ms 312 KB Output is correct
45 Correct 1 ms 216 KB Output is correct
46 Correct 1 ms 216 KB Output is correct
47 Correct 2 ms 216 KB Output is correct
48 Correct 1 ms 312 KB Output is correct
49 Correct 1 ms 216 KB Output is correct
50 Correct 1 ms 216 KB Output is correct
51 Correct 2 ms 260 KB Output is correct
52 Correct 13 ms 216 KB Output is correct
53 Correct 22 ms 308 KB Output is correct
54 Correct 50 ms 324 KB Output is correct
55 Correct 43 ms 384 KB Output is correct
56 Correct 129 ms 344 KB Output is correct
57 Correct 126 ms 332 KB Output is correct
58 Correct 142 ms 340 KB Output is correct
59 Correct 124 ms 332 KB Output is correct
60 Correct 131 ms 332 KB Output is correct
61 Correct 1 ms 208 KB Output is correct
62 Correct 20 ms 336 KB Output is correct
63 Correct 36 ms 204 KB Output is correct
64 Correct 34 ms 324 KB Output is correct
65 Correct 63 ms 344 KB Output is correct
66 Correct 120 ms 344 KB Output is correct
67 Correct 130 ms 332 KB Output is correct
68 Correct 130 ms 348 KB Output is correct
69 Correct 125 ms 344 KB Output is correct