oj.uz

Submission #1031342

# Submission time Handle Problem Language Result Execution time Memory
1031342 2024-07-22T18:13:13 Z _8_8_ Bali Sculptures (APIO15_sculpture) C++17
0 / 100
 1 ms 604 KB 
#include <bits/stdc++.h>
 
using namespace std;
    
typedef long long ll;
const int  N = 2e3 + 21, MOD = (int)1e9+7;

int n,a,b,x[N],dp[N];
void test() {
    cin >> n >> a >> b;
    for(int i = 1;i <= n;i++) {
        cin >> x[i];
    }
    ll cur = 0,res = 0;
    for(ll c = 41;c >= 0;c--){
        for(int i = 1;i <= n;i++){
            dp[i] = 1e9;
        }
        cur += (1ll << c);
        for(int i = 1;i <= n;i++){
            ll s = 0;
            for(int j = i;j >= 1;j--){
                s += x[j];
                if((s & cur) == 0)
                {
                    dp[i] = min(dp[i],dp[j - 1] + 1);
                }
            }
        }
        if(dp[n] == (int)1e9){
            cur -= (1ll << c);
            res += (1ll << c);
        }
    }
    cout << res;
}
int main() {
    ios_base::sync_with_stdio(false);cin.tie(0);
    int t = 1; 
    // cin >> t;
    while(t--) {
        test();
    }
}

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 Incorrect 0 ms 348 KB Output isn't correct
6 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 1 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 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 1 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 Incorrect 0 ms 360 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 25.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 604 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -