oj.uz

Submission #1075400

# Submission time Handle Problem Language Result Execution time Memory
1075400 2024-08-26T05:31:11 Z HappyCapybara Bali Sculptures (APIO15_sculpture) C++17
0 / 100
 10 ms 600 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long

signed main(){
    int n, a, b;
    cin >> n >> a >> b;
    vector<int> v(n);
    for (int i=0; i<n; i++) cin >> v[i];
    int bsf = pow(10, 11);
    for (int i=0; i<(1<<(n-1)); i++){
        //cout << i << "\n";
        int pc = 0;
        for (int j=0; j<n-2; j++){
            if (i & (1<<j)) pc++;
        }
        if (pc < a-1 || pc > b-1) continue;
        //cout << pc << "\n";
        vector<int> w;
        int cur = 0;
        for (int j=0; j<n; j++){
            cur += v[j];
            if (i & (1<<j) || j == n-1){
                w.push_back(cur);
                cur = 0;
            }
        }
        int res = 0;
        for (int x : w) res |= x;
        //cout << i << " " << res << "\n";
        bsf = min(bsf, res);
    }
    cout << bsf << "\n";
}

Subtask #1
0 / 9.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 3 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Incorrect 10 ms 432 KB Output isn't correct
9 Halted 0 ms 0 KB -

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 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 3 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Incorrect 7 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 21.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 436 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Incorrect 7 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 436 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Incorrect 7 ms 344 KB Output isn't correct
9 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 432 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Incorrect 7 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -