답안 #270383

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
270383	2020-08-17T14:38:21 Z	BeanZ	Bali Sculptures (APIO15_sculpture)	C++14	16 / 100	1000 ms	768 KB

sculpture

#include <bits/stdc++.h>

using namespace std;

#define ll int
#define endl '\n'
const int N = 3e6 + 5;
ll dp[2005][2005], a[2005], sum[2005];
bool chk(ll now, ll need){
        return ((need & now) == now);
}
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];
        ll ans = 2048;
        for (int s = 0; s < 2048; s++){
                for (int i = 0; i <= n; i++){
                        for (int j = 0; j <= R; j++){
                                dp[j][i] = 2048;
                        }
                }
                for (int i = 1; i <= n; i++) if (chk(sum[i], s)) dp[1][i] = sum[i];
                if (1 >= L) ans = min(ans, dp[1][n]);
                for (int i = 2; i <= R; i++){
                        for (int j = 1; j <= n; j++){
                                for (int k = 0; k < j; k++){
                                        ll cost = dp[i - 1][k] | (sum[j] - sum[k]);
                                        if (chk(cost, s)){
                                                if (dp[i][j] > cost){
                                                        dp[i][j] = cost;
                                                }
                                        }
                                }
                        }
                        if (i >= L) ans = min(ans, dp[i][n]);
                }
        }
        cout << ans;
}
/*
6 1 3
8 1 2 1 5 4
*/

Compilation message

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

Subtask #1
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	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	11 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	3 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	3 ms	384 KB	Output is correct
13	Correct	15 ms	384 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	2 ms	384 KB	Output is correct
19	Correct	7 ms	464 KB	Output is correct
20	Correct	2 ms	384 KB	Output is correct
21	Correct	6 ms	384 KB	Output is correct
22	Correct	7 ms	384 KB	Output is correct
23	Correct	6 ms	384 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	7 ms	384 KB	Output is correct
26	Correct	11 ms	384 KB	Output is correct
27	Incorrect	1 ms	384 KB	Output isn't correct
28	Halted	0 ms	0 KB	-

Subtask #2
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	2 ms	416 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	8 ms	512 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	3 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	3 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	3 ms	384 KB	Output is correct
13	Correct	18 ms	384 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	416 KB	Output is correct
19	Correct	7 ms	384 KB	Output is correct
20	Correct	3 ms	384 KB	Output is correct
21	Correct	6 ms	384 KB	Output is correct
22	Correct	6 ms	384 KB	Output is correct
23	Correct	6 ms	384 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	6 ms	384 KB	Output is correct
26	Correct	11 ms	384 KB	Output is correct
27	Correct	17 ms	384 KB	Output is correct
28	Correct	14 ms	384 KB	Output is correct
29	Correct	14 ms	512 KB	Output is correct
30	Correct	58 ms	384 KB	Output is correct
31	Correct	84 ms	384 KB	Output is correct
32	Correct	82 ms	384 KB	Output is correct
33	Correct	1 ms	384 KB	Output is correct
34	Correct	89 ms	384 KB	Output is correct
35	Correct	73 ms	384 KB	Output is correct
36	Correct	46 ms	384 KB	Output is correct

Subtask #3
0 / 21.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	8 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	3 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	3 ms	512 KB	Output is correct
13	Correct	14 ms	384 KB	Output is correct
14	Correct	20 ms	384 KB	Output is correct
15	Correct	14 ms	384 KB	Output is correct
16	Correct	15 ms	384 KB	Output is correct
17	Correct	59 ms	384 KB	Output is correct
18	Correct	87 ms	384 KB	Output is correct
19	Correct	83 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	88 ms	384 KB	Output is correct
22	Correct	72 ms	384 KB	Output is correct
23	Correct	46 ms	508 KB	Output is correct
24	Correct	92 ms	504 KB	Output is correct
25	Correct	70 ms	384 KB	Output is correct
26	Correct	242 ms	384 KB	Output is correct
27	Correct	660 ms	632 KB	Output is correct
28	Execution timed out	1088 ms	768 KB	Time limit exceeded
29	Halted	0 ms	0 KB	-

Subtask #4
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	512 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	8 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	16 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	9 ms	384 KB	Output is correct
20	Correct	2 ms	384 KB	Output is correct
21	Correct	7 ms	384 KB	Output is correct
22	Correct	6 ms	384 KB	Output is correct
23	Correct	6 ms	384 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	6 ms	384 KB	Output is correct
26	Correct	15 ms	384 KB	Output is correct
27	Incorrect	1 ms	384 KB	Output isn't correct
28	Halted	0 ms	0 KB	-

Subtask #5
0 / 29.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	1 ms	384 KB	Output is correct
6	Correct	8 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	3 ms	384 KB	Output is correct
10	Correct	3 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	3 ms	384 KB	Output is correct
13	Correct	14 ms	384 KB	Output is correct
14	Incorrect	1 ms	384 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

답안 #270383

Compilation message

Subtask #1 0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 0 / 21.0

Subtask #4 0 / 25.0

Subtask #5 0 / 29.0

Subtask #1
0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
0 / 21.0

Subtask #4
0 / 25.0

Subtask #5
0 / 29.0