oj.uz

Submission #45855

# Submission time Handle Problem Language Result Execution time Memory
45855 2018-04-16T09:29:24 Z Extazy Bali Sculptures (APIO15_sculpture) C++17
37 / 100
 1000 ms 1052 KB 
#include <bits/stdc++.h>
#define endl '\n'

using namespace std;

const int N = 2007;

int n,a,b;
long long arr[N];
long long ans;
long long val;
bool used[N][N],state[N][N];

bool recurse(int pos, int groups) {
    if(pos>n) return a<=groups && groups<=b;
    
    if(used[pos][groups]) return state[pos][groups];
    
    used[pos][groups]=true;

    int i;
    long long sum=0;

    for(i=pos;i<=n;i++) {
        sum+=arr[i];
        //if(sum>val) break;
        if((sum&val)==sum) if(recurse(i+1,groups+1)) return state[pos][groups]=true;
    }

    return state[pos][groups]=false;
}

bool can(long long x) {
    int i,j;

    val=x;
    
    for(i=1;i<=n;i++) {
        for(j=0;j<=n;j++) {
            used[i][j]=false;
        }
    }

    return recurse(1,0);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int i;

    scanf("%d %d %d", &n, &a, &b);
    for(i=1;i<=n;i++) {
        scanf("%lld", &arr[i]);
    }

    ans=0;
    while(!can(ans)) ++ans;
    /*while(!can(ans)) {
        for(i=0;i<40;i++) {
            if(ans&(1ll<<i)) break;
            if(can(ans|(1ll<<i))) {
                ans|=(1ll<<i);
                break;
            }
        }
    }*/

    printf("%lld\n", ans);
    
    return 0;
}

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:52:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d", &n, &a, &b);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:54: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 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 488 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 520 KB Output is correct
6 Correct 2 ms 532 KB Output is correct
7 Correct 2 ms 672 KB Output is correct
8 Correct 2 ms 680 KB Output is correct
9 Correct 2 ms 680 KB Output is correct
10 Correct 2 ms 724 KB Output is correct
11 Correct 2 ms 724 KB Output is correct
12 Correct 2 ms 748 KB Output is correct
13 Correct 2 ms 748 KB Output is correct
14 Correct 2 ms 748 KB Output is correct
15 Correct 2 ms 748 KB Output is correct
16 Correct 2 ms 748 KB Output is correct
17 Correct 2 ms 748 KB Output is correct
18 Correct 2 ms 748 KB Output is correct
19 Correct 2 ms 748 KB Output is correct
20 Correct 2 ms 748 KB Output is correct
21 Correct 2 ms 748 KB Output is correct
22 Correct 2 ms 748 KB Output is correct
23 Correct 2 ms 748 KB Output is correct
24 Correct 2 ms 748 KB Output is correct
25 Correct 2 ms 748 KB Output is correct
26 Correct 2 ms 748 KB Output is correct
27 Execution timed out 1081 ms 748 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1052 KB Output is correct
2 Correct 2 ms 1052 KB Output is correct
3 Correct 2 ms 1052 KB Output is correct
4 Correct 2 ms 1052 KB Output is correct
5 Correct 3 ms 1052 KB Output is correct
6 Correct 2 ms 1052 KB Output is correct
7 Correct 2 ms 1052 KB Output is correct
8 Correct 2 ms 1052 KB Output is correct
9 Correct 2 ms 1052 KB Output is correct
10 Correct 2 ms 1052 KB Output is correct
11 Correct 2 ms 1052 KB Output is correct
12 Correct 2 ms 1052 KB Output is correct
13 Correct 2 ms 1052 KB Output is correct
14 Correct 2 ms 1052 KB Output is correct
15 Correct 2 ms 1052 KB Output is correct
16 Correct 2 ms 1052 KB Output is correct
17 Correct 2 ms 1052 KB Output is correct
18 Correct 2 ms 1052 KB Output is correct
19 Correct 2 ms 1052 KB Output is correct
20 Correct 2 ms 1052 KB Output is correct
21 Correct 2 ms 1052 KB Output is correct
22 Correct 2 ms 1052 KB Output is correct
23 Correct 2 ms 1052 KB Output is correct
24 Correct 2 ms 1052 KB Output is correct
25 Correct 2 ms 1052 KB Output is correct
26 Correct 2 ms 1052 KB Output is correct
27 Execution timed out 1078 ms 1052 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1052 KB Output is correct
2 Correct 2 ms 1052 KB Output is correct
3 Correct 2 ms 1052 KB Output is correct
4 Correct 2 ms 1052 KB Output is correct
5 Correct 2 ms 1052 KB Output is correct
6 Correct 2 ms 1052 KB Output is correct
7 Correct 2 ms 1052 KB Output is correct
8 Correct 2 ms 1052 KB Output is correct
9 Correct 2 ms 1052 KB Output is correct
10 Correct 2 ms 1052 KB Output is correct
11 Correct 2 ms 1052 KB Output is correct
12 Correct 2 ms 1052 KB Output is correct
13 Correct 2 ms 1052 KB Output is correct
14 Execution timed out 1085 ms 1052 KB Time limit exceeded
15 Halted 0 ms 0 KB -