oj.uz

Submission #132133

# Submission time Handle Problem Language Result Execution time Memory
132133 2019-07-18T10:41:19 Z Tuk1352 Bali Sculptures (APIO15_sculpture) C++11
0 / 100
 2 ms 380 KB 
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, A, B;
    cin >> n >> A >> B;
    int a[n], D[n+1], S[n+1];
    S[0] = 0;
    for (int i = 1; i <= n; i++)
    {
        D[i] = 2000000000;
        cin >> a[i-1];
        S[i] = S[i-1] + a[i-1];
    }
    D[0] = 0;
    for (int i = 1; i <= n; i++)
    {
        for (int y = A; y <= B; y++)
        {
            if (i-y >= 0)
            {
                D[i] = min(D[i], D[i-y] | (S[i]-S[i-y]));
            }
        }
    }
    cout << D[n];
    return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Incorrect 2 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 2 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -