oj.uz

Submission #270434

# Submission time Handle Problem Language Result Execution time Memory
270434 2020-08-17T15:26:05 Z BeanZ Bali Sculptures (APIO15_sculpture) C++14
71 / 100
 1000 ms 10752 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define endl '\n'
const int N = 3e6 + 5;
ll dp[2005][2005], f[2005][2005], a[2005], sum[2005];
ll ans = 0;
bool chk(ll now, ll s){
        for (int i = 41; i >= s; i--){
                if ((ans & (1ll << i)) == 0){
                        if (now & (1ll << i)){
                                return false;
                        }
                }
        }
        return true;
}
int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        if (fopen("VietCT.INP", "r")){
                freopen("VietCT.INP", "r", stdin);
                freopen("VietCT.OUT", "w", stdout);
        }
        ll n, L, R;
        cin >> n >> L >> R;
        for (int i = 1; i <= n; i++) cin >> a[i];
        for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i];
        for (int i = 1; i <= R; i++){
                for (int j = i; j <= n; j++){
                        dp[i][j] = 1;
                }
        }
        for (int s = 41; s >= 0; s--){
                for (int i = 1; i <= R; i++){
                        for (int j = i; j <= n; j++){
                                f[i][j] = dp[i][j];
                        }
                }
                for (int i = 1; i <= n; i++){
                        if (f[1][i] == 0) continue;
                        if (sum[i] & (1ll << s)) f[1][i] = 0;
                }
                bool ok = false;
                if (f[1][n] && 1 >= L) ok = true;
                for (int i = 2; i <= R; i++){
                        for (int j = i; j <= n; j++){
                                if (f[i][j] == 0) continue;
                                bool flag = false;
                                for (int k = i - 1; k < j; k++){
                                        if (f[i - 1][k] == 0) continue;
                                        ll cost = sum[j] - sum[k];
                                        if (chk(cost, s)){
                                                flag = true;
                                                break;
                                        }
                                }
                                if (flag) f[i][j] = 1;
                                else f[i][j] = 0;
                        }
                        if (i >= L && f[i][n]) ok = true;
                }
                if (ok){
                        for (int i = 1; i <= R; i++){
                                for (int j = i; j <= n; j++){
                                        dp[i][j] = f[i][j];
                                }
                        }
                } else {
                        ans = ans + (1ll << s);
                }
        }
        cout << ans;
}
/*
6 1 3
8 1 2 1 5 4
*/

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:24:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   24 |                 freopen("VietCT.INP", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:25:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   25 |                 freopen("VietCT.OUT", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 512 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 1 ms 512 KB Output is correct
34 Correct 1 ms 512 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 512 KB Output is correct
37 Correct 1 ms 512 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 2 ms 512 KB Output is correct
41 Correct 3 ms 640 KB Output is correct
42 Correct 2 ms 512 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 2 ms 512 KB Output is correct
45 Correct 2 ms 512 KB Output is correct
46 Correct 2 ms 384 KB Output is correct
47 Correct 2 ms 512 KB Output is correct
48 Correct 3 ms 384 KB Output is correct
49 Correct 6 ms 512 KB Output is correct
50 Correct 13 ms 896 KB Output is correct
51 Correct 18 ms 1280 KB Output is correct
52 Correct 18 ms 1280 KB Output is correct
53 Correct 0 ms 384 KB Output is correct
54 Correct 17 ms 768 KB Output is correct
55 Correct 18 ms 1024 KB Output is correct
56 Correct 1 ms 512 KB Output is correct
57 Correct 5 ms 512 KB Output is correct
58 Correct 6 ms 896 KB Output is correct
59 Correct 6 ms 1280 KB Output is correct
60 Correct 6 ms 1280 KB Output is correct
61 Correct 1 ms 384 KB Output is correct
62 Correct 10 ms 1280 KB Output is correct
63 Correct 14 ms 1280 KB Output is correct
64 Correct 16 ms 1152 KB Output is correct
65 Correct 2 ms 512 KB Output is correct
66 Correct 2 ms 384 KB Output is correct
67 Correct 3 ms 512 KB Output is correct
68 Correct 7 ms 896 KB Output is correct
69 Correct 6 ms 1280 KB Output is correct
70 Correct 5 ms 1280 KB Output is correct
71 Correct 1 ms 384 KB Output is correct
72 Correct 14 ms 1184 KB Output is correct
73 Correct 12 ms 1024 KB Output is correct
74 Correct 12 ms 896 KB Output is correct

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 3 ms 512 KB Output is correct
29 Correct 3 ms 512 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 2 ms 512 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 2 ms 512 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 6 ms 512 KB Output is correct
37 Correct 15 ms 896 KB Output is correct
38 Correct 19 ms 1280 KB Output is correct
39 Correct 19 ms 1280 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 18 ms 768 KB Output is correct
42 Correct 19 ms 1024 KB Output is correct
43 Correct 1 ms 512 KB Output is correct
44 Correct 5 ms 512 KB Output is correct
45 Correct 6 ms 896 KB Output is correct
46 Correct 6 ms 1280 KB Output is correct
47 Correct 7 ms 1280 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 9 ms 1280 KB Output is correct
50 Correct 14 ms 1280 KB Output is correct
51 Correct 4 ms 512 KB Output is correct
52 Correct 749 ms 2040 KB Output is correct
53 Execution timed out 1094 ms 10752 KB Time limit exceeded
54 Halted 0 ms 0 KB -