oj.uz

Submission #705182

# Submission time Handle Problem Language Result Execution time Memory
705182 2023-03-03T14:07:16 Z Alihan_8 Bali Sculptures (APIO15_sculpture) C++17
16 / 100
 5 ms 5216 KB 
#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 = 501;
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

# Verdict Execution time Memory Grader output
1 Correct 1 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 328 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 852 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1096 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 1096 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 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 716 KB Output is correct
20 Correct 1 ms 852 KB Output is correct
21 Correct 2 ms 1108 KB Output is correct
22 Correct 1 ms 1108 KB Output is correct
23 Correct 1 ms 1096 KB Output is correct
24 Correct 1 ms 1108 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct
26 Correct 1 ms 1108 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

# Verdict Execution time Memory Grader output
1 Correct 1 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 852 KB Output is correct
8 Correct 2 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1096 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 1096 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 332 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 1 ms 852 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 1092 KB Output is correct
23 Correct 1 ms 1108 KB Output is correct
24 Correct 1 ms 1108 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct
26 Correct 1 ms 1108 KB Output is correct
27 Correct 1 ms 1236 KB Output is correct
28 Correct 2 ms 1480 KB Output is correct
29 Correct 3 ms 3156 KB Output is correct
30 Correct 3 ms 3796 KB Output is correct
31 Correct 5 ms 5204 KB Output is correct
32 Correct 4 ms 5196 KB Output is correct
33 Correct 4 ms 5204 KB Output is correct
34 Correct 5 ms 5204 KB Output is correct
35 Correct 4 ms 5204 KB Output is correct
36 Correct 5 ms 5188 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory 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 332 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 852 KB Output is correct
8 Correct 1 ms 1120 KB Output is correct
9 Correct 1 ms 1120 KB Output is correct
10 Correct 2 ms 1104 KB Output is correct
11 Correct 1 ms 1120 KB Output is correct
12 Correct 1 ms 1120 KB Output is correct
13 Correct 1 ms 1120 KB Output is correct
14 Correct 1 ms 1248 KB Output is correct
15 Correct 1 ms 1504 KB Output is correct
16 Correct 2 ms 3168 KB Output is correct
17 Correct 3 ms 3808 KB Output is correct
18 Correct 5 ms 5200 KB Output is correct
19 Correct 4 ms 5216 KB Output is correct
20 Correct 5 ms 5216 KB Output is correct
21 Correct 5 ms 5196 KB Output is correct
22 Correct 5 ms 5216 KB Output is correct
23 Correct 5 ms 5208 KB Output is correct
24 Runtime error 3 ms 2008 KB Execution killed with signal 11
25 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 456 KB Output is correct
3 Correct 1 ms 340 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 840 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1088 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1092 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 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 460 KB Output is correct
19 Correct 1 ms 716 KB Output is correct
20 Correct 1 ms 844 KB Output is correct
21 Correct 1 ms 1096 KB Output is correct
22 Correct 1 ms 1092 KB Output is correct
23 Correct 1 ms 1100 KB Output is correct
24 Correct 2 ms 1108 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct
26 Correct 1 ms 1092 KB Output is correct
27 Runtime error 1 ms 464 KB Execution killed with signal 11
28 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 328 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 1 ms 712 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 1 ms 1096 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1092 KB Output is correct
11 Correct 2 ms 1108 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Runtime error 1 ms 468 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -