oj.uz

Submission #45868

# Submission time Handle Problem Language Result Execution time Memory
45868 2018-04-16T09:41:48 Z Extazy Bali Sculptures (APIO15_sculpture) C++17
100 / 100
 247 ms 1056 KB 
#include <bits/stdc++.h>
#define endl '\n'

using namespace std;

const int N = 2007;
const int INF = N + 7;

int n,a,b;
long long arr[N];
long long ans;
long long val;
bool used[N][N],state[N][N];
bool used2[N];
int state2[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)==sum) if(recurse(i+1,groups+1)) return state[pos][groups]=true;
    }

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

int recurse2(int pos) {
    if(pos>n) return 0;

    if(used2[pos]) return state2[pos];

    long long sum=0;
    int i,ans=INF;

    for(i=pos;i<=n;i++) {
        sum+=arr[i];
        if((sum&val)==sum) ans=min(ans,recurse2(i+1)+1);
    }

    used2[pos]=true;
    return state2[pos]=ans;
}

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

    val=x;

    if(a==1) {
        for(i=1;i<=n;i++) {
            used2[i]=false;
        }
        return recurse2(1)<=b;
    }
    
    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]);
    }

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

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

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:78: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:80:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld", &arr[i]);
         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 668 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 2 ms 724 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 724 KB Output is correct
13 Correct 2 ms 724 KB Output is correct
14 Correct 2 ms 724 KB Output is correct
15 Correct 2 ms 740 KB Output is correct
16 Correct 2 ms 740 KB Output is correct
17 Correct 2 ms 740 KB Output is correct
18 Correct 2 ms 752 KB Output is correct
19 Correct 2 ms 752 KB Output is correct
20 Correct 2 ms 752 KB Output is correct
21 Correct 2 ms 752 KB Output is correct
22 Correct 2 ms 752 KB Output is correct
23 Correct 2 ms 752 KB Output is correct
24 Correct 2 ms 752 KB Output is correct
25 Correct 2 ms 752 KB Output is correct
26 Correct 2 ms 752 KB Output is correct
27 Correct 2 ms 752 KB Output is correct
28 Correct 2 ms 752 KB Output is correct
29 Correct 2 ms 752 KB Output is correct
30 Correct 2 ms 752 KB Output is correct
31 Correct 2 ms 752 KB Output is correct
32 Correct 2 ms 752 KB Output is correct
33 Correct 2 ms 752 KB Output is correct
34 Correct 2 ms 752 KB Output is correct
35 Correct 2 ms 752 KB Output is correct
36 Correct 2 ms 752 KB Output is correct

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 752 KB Output is correct
2 Correct 2 ms 752 KB Output is correct
3 Correct 2 ms 752 KB Output is correct
4 Correct 2 ms 752 KB Output is correct
5 Correct 2 ms 752 KB Output is correct
6 Correct 2 ms 752 KB Output is correct
7 Correct 2 ms 752 KB Output is correct
8 Correct 2 ms 752 KB Output is correct
9 Correct 2 ms 752 KB Output is correct
10 Correct 2 ms 752 KB Output is correct
11 Correct 2 ms 752 KB Output is correct
12 Correct 2 ms 752 KB Output is correct
13 Correct 2 ms 752 KB Output is correct
14 Correct 2 ms 752 KB Output is correct
15 Correct 2 ms 752 KB Output is correct
16 Correct 2 ms 752 KB Output is correct
17 Correct 2 ms 752 KB Output is correct
18 Correct 2 ms 764 KB Output is correct
19 Correct 2 ms 764 KB Output is correct
20 Correct 2 ms 764 KB Output is correct
21 Correct 2 ms 764 KB Output is correct
22 Correct 2 ms 764 KB Output is correct
23 Correct 2 ms 764 KB Output is correct
24 Correct 2 ms 764 KB Output is correct
25 Correct 2 ms 764 KB Output is correct
26 Correct 2 ms 764 KB Output is correct
27 Correct 2 ms 764 KB Output is correct
28 Correct 2 ms 764 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 2 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
37 Correct 2 ms 764 KB Output is correct
38 Correct 2 ms 764 KB Output is correct
39 Correct 2 ms 764 KB Output is correct
40 Correct 2 ms 764 KB Output is correct
41 Correct 2 ms 764 KB Output is correct
42 Correct 2 ms 764 KB Output is correct
43 Correct 2 ms 764 KB Output is correct
44 Correct 2 ms 764 KB Output is correct
45 Correct 2 ms 764 KB Output is correct
46 Correct 2 ms 764 KB Output is correct
47 Correct 2 ms 764 KB Output is correct
48 Correct 2 ms 764 KB Output is correct
49 Correct 2 ms 764 KB Output is correct
50 Correct 2 ms 764 KB Output is correct
51 Correct 3 ms 764 KB Output is correct
52 Correct 2 ms 764 KB Output is correct
53 Correct 2 ms 764 KB Output is correct
54 Correct 2 ms 764 KB Output is correct
55 Correct 2 ms 764 KB Output is correct
56 Correct 2 ms 764 KB Output is correct
57 Correct 2 ms 764 KB Output is correct
58 Correct 3 ms 764 KB Output is correct
59 Correct 3 ms 764 KB Output is correct
60 Correct 2 ms 764 KB Output is correct
61 Correct 3 ms 764 KB Output is correct
62 Correct 2 ms 764 KB Output is correct
63 Correct 2 ms 764 KB Output is correct
64 Correct 2 ms 896 KB Output is correct
65 Correct 3 ms 896 KB Output is correct
66 Correct 7 ms 896 KB Output is correct
67 Correct 5 ms 896 KB Output is correct
68 Correct 6 ms 1020 KB Output is correct
69 Correct 6 ms 1020 KB Output is correct
70 Correct 4 ms 1020 KB Output is correct
71 Correct 14 ms 1020 KB Output is correct
72 Correct 5 ms 1056 KB Output is correct
73 Correct 6 ms 1056 KB Output is correct
74 Correct 6 ms 1056 KB Output is correct

Subtask #5
29.0 / 29.0

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