oj.uz

Submission #918329

# Submission time Handle Problem Language Result Execution time Memory
918329 2024-01-29T16:29:35 Z phamducminh Bali Sculptures (APIO15_sculpture) C++17
9 / 100
 1000 ms 692 KB 
//******************/
//*   I<3   C++    */
//*  I WANT ANY AC */
//* I LOVE PROGRAM!*/
//*IT'S long longERESTING*/
//* I LOVE PROGRAM!*/
//*  IN CONTESTS   */
//*   GET SCORE    */
//*    AC CODE     */
//*     LET'S      */
//*      GO        */
//*  Written by:   */
//*   Duc Minh     */






#include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <algorithm>
#include <string>
#include <queue>
#include <cctype>
#include <cstring>
#include <iomanip>
#include <deque>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>

using namespace std;
// using namespace __gnu_pbds;

#define  file(name)  freopen(name".inp", "r", stdin);\
                     freopen(name".out", "w", stdout);
#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define TIME        (1.0 * clock() / CLOCKS_PER_SEC)
#define all(a)      a.begin(),a.end()
#define endl        "\n"
#define all1(a)     a+1,a+n+1
#define unordered_map  map
#define Accepted 0      
// #define push_back   emplace_back
// #define gcd(a,b)    __gcd(a,b);
// #define lcm(a,b)    (a*b)/gcd(a,b);

const long long INF = (long long)1e18;
const long long MOD = (long long)1e9+7;
const long long MODD = 14062008; /// 998244353
const long long maxN = 2e5+9;
const long long LOG = 30;







///--------------------------------


void solve();

signed main(){

    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);






    long long t;


    // cin >> t;

    t=1;



    while (t--){




        solve();


    }





    cerr << "Time elapsed: " << TIME << "s.\n";
    cerr << "ducminh" << "\n";
    return Accepted;
}



///--------------------[PROBLEM SOLUTION]--------------------///



long long a[200009];

void solve(){


    long long ans=INF,n,L,R;

    cin >> n >> L >> R;


    for (long long i=0; i<n; i++){

        cin >> a[i];
    }


    for (long long mask=0; mask<(1<<n); mask++){

        long long sum=0,g=0;
        for (long long i=0; i<n; i++){
            sum+=a[i];
            if ((mask>>i)&1){
                g|=sum;
                sum=0;
            }
        }

        g|=sum;

        long long bits=__builtin_popcount(mask) + ((mask & (1 << (n - 1))) == 0);

        if (L<=bits && bits<=R) ans=min(ans,g);
    }

    cout << ans;


}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 8 ms 348 KB Output is correct
8 Correct 68 ms 692 KB Output is correct
9 Correct 68 ms 440 KB Output is correct
10 Correct 68 ms 448 KB Output is correct
11 Correct 66 ms 440 KB Output is correct
12 Correct 65 ms 348 KB Output is correct
13 Correct 66 ms 436 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 8 ms 344 KB Output is correct
21 Correct 64 ms 432 KB Output is correct
22 Correct 64 ms 344 KB Output is correct
23 Correct 64 ms 348 KB Output is correct
24 Correct 66 ms 348 KB Output is correct
25 Correct 64 ms 348 KB Output is correct
26 Correct 64 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 32 ms 348 KB Output is correct
31 Correct 64 ms 344 KB Output is correct
32 Correct 66 ms 348 KB Output is correct
33 Correct 65 ms 432 KB Output is correct
34 Correct 69 ms 432 KB Output is correct
35 Correct 66 ms 436 KB Output is correct
36 Correct 65 ms 436 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 416 KB Output is correct
4 Correct 1 ms 536 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 65 ms 348 KB Output is correct
9 Correct 66 ms 348 KB Output is correct
10 Correct 68 ms 348 KB Output is correct
11 Correct 66 ms 344 KB Output is correct
12 Correct 66 ms 344 KB Output is correct
13 Correct 68 ms 436 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 8 ms 348 KB Output is correct
21 Correct 64 ms 600 KB Output is correct
22 Correct 66 ms 436 KB Output is correct
23 Correct 66 ms 344 KB Output is correct
24 Correct 66 ms 348 KB Output is correct
25 Correct 64 ms 348 KB Output is correct
26 Correct 63 ms 344 KB Output is correct
27 Correct 139 ms 436 KB Output is correct
28 Execution timed out 1056 ms 348 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 8 ms 348 KB Output is correct
8 Correct 69 ms 440 KB Output is correct
9 Correct 66 ms 348 KB Output is correct
10 Correct 66 ms 344 KB Output is correct
11 Correct 65 ms 440 KB Output is correct
12 Correct 66 ms 348 KB Output is correct
13 Correct 66 ms 348 KB Output is correct
14 Correct 134 ms 592 KB Output is correct
15 Execution timed out 1044 ms 344 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 8 ms 348 KB Output is correct
8 Correct 69 ms 348 KB Output is correct
9 Correct 65 ms 348 KB Output is correct
10 Correct 73 ms 348 KB Output is correct
11 Correct 66 ms 344 KB Output is correct
12 Correct 66 ms 440 KB Output is correct
13 Correct 66 ms 432 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 8 ms 460 KB Output is correct
21 Correct 64 ms 348 KB Output is correct
22 Correct 64 ms 600 KB Output is correct
23 Correct 63 ms 436 KB Output is correct
24 Correct 70 ms 440 KB Output is correct
25 Correct 64 ms 348 KB Output is correct
26 Correct 71 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 33 ms 412 KB Output is correct
31 Correct 63 ms 432 KB Output is correct
32 Correct 66 ms 344 KB Output is correct
33 Correct 63 ms 440 KB Output is correct
34 Correct 73 ms 348 KB Output is correct
35 Correct 66 ms 344 KB Output is correct
36 Correct 69 ms 436 KB Output is correct
37 Correct 140 ms 432 KB Output is correct
38 Execution timed out 1033 ms 344 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 8 ms 460 KB Output is correct
8 Correct 72 ms 344 KB Output is correct
9 Correct 66 ms 436 KB Output is correct
10 Correct 67 ms 348 KB Output is correct
11 Correct 66 ms 436 KB Output is correct
12 Correct 67 ms 348 KB Output is correct
13 Correct 69 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 33 ms 348 KB Output is correct
18 Correct 67 ms 436 KB Output is correct
19 Correct 67 ms 348 KB Output is correct
20 Correct 64 ms 500 KB Output is correct
21 Correct 66 ms 348 KB Output is correct
22 Correct 71 ms 432 KB Output is correct
23 Correct 66 ms 440 KB Output is correct
24 Correct 142 ms 440 KB Output is correct
25 Execution timed out 1074 ms 348 KB Time limit exceeded
26 Halted 0 ms 0 KB -