답안 #270477

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
270477	2020-08-17T16:23:07 Z	BeanZ	Bali Sculptures (APIO15_sculpture)	C++14	50 / 100	537 ms	512 KB

sculpture

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define endl '\n'
const int N = 3e6 + 5;
ll dp[2005], f[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 s = 41; s >= 0; s--){
                for (int i = 1; i <= n; i++){
                        f[i] = dp[i];
                }
                for (int i = 1; i <= n; i++){
                        if (f[i] == -1) continue;
                        f[i] = 1e9;
                        for (int j = 0; j < i; j++){
                                if (f[j] == -1) continue;
                                ll cost = sum[i] - sum[j];
                                if (chk(cost, s)){
                                        f[i] = min(f[i], f[j] + 1);
                                }
                        }
                        if (f[i] == 1e9) f[i] = -1;
                        //cout << f[i] << " ";
                }
                //cout << endl;
                if (f[n] <= R && f[n] != -1){
                        for (int i = 1; i <= n; i++){
                                if (f[i] <= R) dp[i] = f[i];
                                else dp[i] = -1;
                        }
                } 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
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	1 ms	384 KB	Output is correct
6	Correct	1 ms	384 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	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Incorrect	1 ms	384 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #2
0 / 16.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	384 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	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Incorrect	0 ms	384 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

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	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	384 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	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	2 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	2 ms	360 KB	Output is correct
21	Correct	2 ms	384 KB	Output is correct
22	Correct	2 ms	384 KB	Output is correct
23	Correct	3 ms	384 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	4 ms	384 KB	Output is correct
26	Correct	4 ms	384 KB	Output is correct
27	Correct	4 ms	384 KB	Output is correct
28	Correct	7 ms	384 KB	Output is correct
29	Correct	6 ms	384 KB	Output is correct
30	Correct	5 ms	384 KB	Output is correct
31	Correct	8 ms	384 KB	Output is correct
32	Correct	6 ms	384 KB	Output is correct

Subtask #4
0 / 25.0

#	결과	실행 시간	메모리	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	384 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	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Incorrect	1 ms	384 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #5
29.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	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	2 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	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	384 KB	Output is correct
19	Correct	0 ms	384 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	2 ms	384 KB	Output is correct
26	Correct	2 ms	384 KB	Output is correct
27	Correct	1 ms	384 KB	Output is correct
28	Correct	3 ms	384 KB	Output is correct
29	Correct	2 ms	384 KB	Output is correct
30	Correct	3 ms	384 KB	Output is correct
31	Correct	2 ms	384 KB	Output is correct
32	Correct	3 ms	384 KB	Output is correct
33	Correct	2 ms	384 KB	Output is correct
34	Correct	2 ms	384 KB	Output is correct
35	Correct	2 ms	384 KB	Output is correct
36	Correct	4 ms	384 KB	Output is correct
37	Correct	4 ms	384 KB	Output is correct
38	Correct	5 ms	384 KB	Output is correct
39	Correct	5 ms	384 KB	Output is correct
40	Correct	5 ms	384 KB	Output is correct
41	Correct	5 ms	384 KB	Output is correct
42	Correct	5 ms	384 KB	Output is correct
43	Correct	1 ms	384 KB	Output is correct
44	Correct	2 ms	384 KB	Output is correct
45	Correct	2 ms	384 KB	Output is correct
46	Correct	1 ms	384 KB	Output is correct
47	Correct	2 ms	384 KB	Output is correct
48	Correct	1 ms	384 KB	Output is correct
49	Correct	2 ms	384 KB	Output is correct
50	Correct	2 ms	384 KB	Output is correct
51	Correct	2 ms	384 KB	Output is correct
52	Correct	44 ms	384 KB	Output is correct
53	Correct	32 ms	384 KB	Output is correct
54	Correct	164 ms	440 KB	Output is correct
55	Correct	119 ms	504 KB	Output is correct
56	Correct	214 ms	384 KB	Output is correct
57	Correct	187 ms	504 KB	Output is correct
58	Correct	236 ms	384 KB	Output is correct
59	Correct	333 ms	384 KB	Output is correct
60	Correct	56 ms	384 KB	Output is correct
61	Correct	3 ms	384 KB	Output is correct
62	Correct	35 ms	384 KB	Output is correct
63	Correct	165 ms	384 KB	Output is correct
64	Correct	51 ms	512 KB	Output is correct
65	Correct	103 ms	384 KB	Output is correct
66	Correct	146 ms	504 KB	Output is correct
67	Correct	32 ms	384 KB	Output is correct
68	Correct	537 ms	468 KB	Output is correct
69	Correct	189 ms	384 KB	Output is correct

답안 #270477

Compilation message

Subtask #1 0 / 9.0

Subtask #2 0 / 16.0

Subtask #3 21.0 / 21.0

Subtask #4 0 / 25.0

Subtask #5 29.0 / 29.0

Subtask #1
0 / 9.0

Subtask #2
0 / 16.0

Subtask #3
21.0 / 21.0

Subtask #4
0 / 25.0

Subtask #5
29.0 / 29.0