oj.uz

답안 #270487

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
270487 2020-08-17T16:29:23 Z BeanZ Bali Sculptures (APIO15_sculpture) C++14
100 / 100
 494 ms 1280 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], d[2005], fp[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];
        if (n > 100){
                for (int s = 41; s >= 0; s--){
                        for (int i = 1; i <= n; i++){
                                fp[i] = d[i];
                        }
                        for (int i = 1; i <= n; i++){
                                if (fp[i] == -1) continue;
                                fp[i] = 1e9;
                                for (int j = 0; j < i; j++){
                                        if (fp[j] == -1) continue;
                                        ll cost = sum[i] - sum[j];
                                        if (chk(cost, s)){
                                                fp[i] = min(fp[i], fp[j] + 1);
                                        }
                                }
                                if (fp[i] == 1e9) fp[i] = -1;
                                //cout << f[i] << " ";
                        }
                        //cout << endl;
                        if (fp[n] <= R && fp[n] != -1){
                                for (int i = 1; i <= n; i++){
                                        if (fp[i] <= R) d[i] = fp[i];
                                        else d[i] = -1;
                                }
                        } else {
                                ans = ans + (1ll << s);
                        }
                }
                cout << ans;
        } else {
                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];
                                        //cout << f[i][j] << " " << i << " " << j << endl;
                                }
                        }
                        //cout << endl << endl;
                        for (int i = 1; i <= n; i++){
                                if (f[1][i] == 0) continue;
                                if (sum[i] & (1ll << s)) f[1][i] = 0;
                                //cout << f[1][i] << " " << 1 << " " << i << endl;
                        }
                        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;
                                        //cout << f[i][j] << " " << i << " " << j << endl;
                                }
                                if (i >= L && f[i][n]) ok = true;
                        }
                        //cout << ok << endl;
                        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 << endl << endl;
                }
                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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 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 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 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 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 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 512 KB Output is correct
27 Correct 0 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 1 ms 384 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 512 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 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 0 ms 384 KB Output is correct
16 Correct 0 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 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 512 KB Output is correct
27 Correct 1 ms 512 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 2 ms 512 KB Output is correct
32 Correct 2 ms 512 KB Output is correct
33 Correct 1 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

# 결과 실행 시간 메모리 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 312 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 416 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 436 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 2 ms 512 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 3 ms 512 KB Output is correct
20 Correct 1 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 32 ms 1280 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 16 ms 832 KB Output is correct
32 Correct 19 ms 1024 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 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 1 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 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 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 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 0 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 1 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 4 ms 512 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 2 ms 384 KB Output is correct
49 Correct 6 ms 512 KB Output is correct
50 Correct 12 ms 896 KB Output is correct
51 Correct 17 ms 1280 KB Output is correct
52 Correct 17 ms 1280 KB Output is correct
53 Correct 0 ms 384 KB Output is correct
54 Correct 16 ms 848 KB Output is correct
55 Correct 16 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 5 ms 896 KB Output is correct
59 Correct 7 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 15 ms 1280 KB Output is correct
63 Correct 15 ms 1280 KB Output is correct
64 Correct 17 ms 1152 KB Output is correct
65 Correct 1 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 8 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 12 ms 1280 KB Output is correct
73 Correct 13 ms 1024 KB Output is correct
74 Correct 14 ms 896 KB Output is correct

Subtask #5
29.0 / 29.0

# 결과 실행 시간 메모리 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 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 0 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 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 0 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 2 ms 512 KB Output is correct
29 Correct 2 ms 512 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 2 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 12 ms 896 KB Output is correct
38 Correct 18 ms 1280 KB Output is correct
39 Correct 17 ms 1280 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 16 ms 768 KB Output is correct
42 Correct 16 ms 1024 KB Output is correct
43 Correct 1 ms 512 KB Output is correct
44 Correct 4 ms 512 KB Output is correct
45 Correct 4 ms 896 KB Output is correct
46 Correct 6 ms 1280 KB Output is correct
47 Correct 5 ms 1280 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 13 ms 1280 KB Output is correct
50 Correct 15 ms 1280 KB Output is correct
51 Correct 2 ms 384 KB Output is correct
52 Correct 41 ms 384 KB Output is correct
53 Correct 30 ms 384 KB Output is correct
54 Correct 164 ms 384 KB Output is correct
55 Correct 120 ms 384 KB Output is correct
56 Correct 200 ms 384 KB Output is correct
57 Correct 179 ms 384 KB Output is correct
58 Correct 216 ms 384 KB Output is correct
59 Correct 285 ms 384 KB Output is correct
60 Correct 62 ms 504 KB Output is correct
61 Correct 3 ms 384 KB Output is correct
62 Correct 29 ms 384 KB Output is correct
63 Correct 165 ms 384 KB Output is correct
64 Correct 51 ms 504 KB Output is correct
65 Correct 98 ms 384 KB Output is correct
66 Correct 138 ms 384 KB Output is correct
67 Correct 31 ms 384 KB Output is correct
68 Correct 494 ms 452 KB Output is correct
69 Correct 193 ms 384 KB Output is correct