답안 #705184

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
705184	2023-03-03T14:11:40 Z	Alihan_8	Bali Sculptures (APIO15_sculpture)	C++17	16 / 100	15 ms	6752 KB

sculpture

#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
const int N = 2e3+1;
int dp[51][51][N];
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, A, B; cin >> n >> A >> B;
    vector <int> p(n);
    for ( auto &i: p ) cin >> i;
    dp[0][0][0] = 1;
    for ( int i = 0; i < n; i++ ){
        for ( int k = 0; k < n; k++ ){
            for ( int Or = 0; Or < N; Or++ ){
                int cnt = 0;
                if ( !dp[i][k][Or] ) continue;
                for ( int j = i+1; j <= n; j++ ){
                    cnt += p[j-1];
                    dp[j][k+1][cnt | Or] = true;
                }
            }
        }
    }
    int Mn = N+1;
    for ( int i = A; i <= B; i++ ){
        for ( int Or = 0; Or < N; Or++ ){
            if ( dp[n][i][Or] ) Mn = min(Mn, Or);
        }
    }
    cout << Mn;


    cout << '\n';
}
/*
6 1 3
8 1 2 1 5 4
*/

Compilation message

sculpture.cpp: In function 'void IO(std::string)':
sculpture.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	468 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	2 ms	724 KB	Output is correct
7	Correct	1 ms	980 KB	Output is correct
8	Correct	2 ms	1108 KB	Output is correct
9	Correct	2 ms	1236 KB	Output is correct
10	Correct	2 ms	1236 KB	Output is correct
11	Correct	2 ms	1236 KB	Output is correct
12	Correct	2 ms	1108 KB	Output is correct
13	Correct	2 ms	1108 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	468 KB	Output is correct
19	Correct	1 ms	852 KB	Output is correct
20	Correct	1 ms	980 KB	Output is correct
21	Correct	2 ms	1236 KB	Output is correct
22	Correct	3 ms	1236 KB	Output is correct
23	Correct	2 ms	1236 KB	Output is correct
24	Correct	3 ms	1236 KB	Output is correct
25	Correct	3 ms	1108 KB	Output is correct
26	Correct	2 ms	1236 KB	Output is correct
27	Runtime error	1 ms	468 KB	Execution killed with signal 11
28	Halted	0 ms	0 KB	-

Subtask #2
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	468 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	1 ms	724 KB	Output is correct
7	Correct	1 ms	980 KB	Output is correct
8	Correct	2 ms	1108 KB	Output is correct
9	Correct	2 ms	1236 KB	Output is correct
10	Correct	2 ms	1236 KB	Output is correct
11	Correct	2 ms	1236 KB	Output is correct
12	Correct	2 ms	1108 KB	Output is correct
13	Correct	2 ms	1108 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	1 ms	468 KB	Output is correct
19	Correct	1 ms	724 KB	Output is correct
20	Correct	2 ms	980 KB	Output is correct
21	Correct	2 ms	1236 KB	Output is correct
22	Correct	2 ms	1236 KB	Output is correct
23	Correct	2 ms	1236 KB	Output is correct
24	Correct	2 ms	1236 KB	Output is correct
25	Correct	2 ms	1108 KB	Output is correct
26	Correct	2 ms	1236 KB	Output is correct
27	Correct	2 ms	1236 KB	Output is correct
28	Correct	4 ms	1748 KB	Output is correct
29	Correct	8 ms	3668 KB	Output is correct
30	Correct	7 ms	4436 KB	Output is correct
31	Correct	11 ms	6740 KB	Output is correct
32	Correct	13 ms	6752 KB	Output is correct
33	Correct	15 ms	6752 KB	Output is correct
34	Correct	11 ms	6228 KB	Output is correct
35	Correct	11 ms	6292 KB	Output is correct
36	Correct	12 ms	6316 KB	Output is correct

Subtask #3
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	468 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	1 ms	724 KB	Output is correct
7	Correct	1 ms	980 KB	Output is correct
8	Correct	2 ms	1236 KB	Output is correct
9	Correct	2 ms	1236 KB	Output is correct
10	Correct	2 ms	1236 KB	Output is correct
11	Correct	2 ms	1236 KB	Output is correct
12	Correct	2 ms	1108 KB	Output is correct
13	Correct	2 ms	1108 KB	Output is correct
14	Correct	2 ms	1236 KB	Output is correct
15	Correct	3 ms	1748 KB	Output is correct
16	Correct	6 ms	3612 KB	Output is correct
17	Correct	8 ms	4348 KB	Output is correct
18	Correct	12 ms	6740 KB	Output is correct
19	Correct	13 ms	6740 KB	Output is correct
20	Correct	11 ms	6740 KB	Output is correct
21	Correct	11 ms	6228 KB	Output is correct
22	Correct	12 ms	6356 KB	Output is correct
23	Correct	12 ms	6316 KB	Output is correct
24	Runtime error	2 ms	980 KB	Execution killed with signal 11
25	Halted	0 ms	0 KB	-

Subtask #4
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	468 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	1 ms	724 KB	Output is correct
7	Correct	1 ms	980 KB	Output is correct
8	Correct	2 ms	1236 KB	Output is correct
9	Correct	2 ms	1236 KB	Output is correct
10	Correct	2 ms	1236 KB	Output is correct
11	Correct	2 ms	1236 KB	Output is correct
12	Correct	2 ms	1108 KB	Output is correct
13	Correct	3 ms	1108 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	468 KB	Output is correct
19	Correct	1 ms	724 KB	Output is correct
20	Correct	2 ms	980 KB	Output is correct
21	Correct	2 ms	1236 KB	Output is correct
22	Correct	2 ms	1236 KB	Output is correct
23	Correct	2 ms	1236 KB	Output is correct
24	Correct	2 ms	1236 KB	Output is correct
25	Correct	2 ms	1108 KB	Output is correct
26	Correct	2 ms	1236 KB	Output is correct
27	Runtime error	1 ms	468 KB	Execution killed with signal 11
28	Halted	0 ms	0 KB	-

Subtask #5
0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	468 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	2 ms	468 KB	Output is correct
6	Correct	1 ms	724 KB	Output is correct
7	Correct	2 ms	980 KB	Output is correct
8	Correct	2 ms	1108 KB	Output is correct
9	Correct	2 ms	1236 KB	Output is correct
10	Correct	2 ms	1236 KB	Output is correct
11	Correct	2 ms	1236 KB	Output is correct
12	Correct	2 ms	1108 KB	Output is correct
13	Correct	2 ms	1108 KB	Output is correct
14	Runtime error	1 ms	340 KB	Execution killed with signal 11
15	Halted	0 ms	0 KB	-

답안 #705184

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