oj.uz

Submission #505053

# Submission time Handle Problem Language Result Execution time Memory
505053 2022-01-10T12:45:10 Z amukkalir Bali Sculptures (APIO15_sculpture) C++17
21 / 100
 16 ms 31820 KB 
#include <bits/stdc++.h> 
using namespace std; 
typedef long long ll; 
 
#define pii pair<int,int> 
#define fi first 
#define se second
 
const ll INF = LLONG_MAX; 
const int nax = 2000; 
 
ll dp[nax+5][nax+5]; 
ll p[nax+5]; 
int n; 
 
ll f (int rem, int idx) {
    if(idx==n+1) return (rem==0)?0:INF; 
    if(rem<=0 && idx != n+1) return INF; 
 
    ll &res = dp[rem][idx]; 
    if(~res) return res; 
 
    res = INF; 
    for(int i=idx; i<=n; i++) {
        res = min(res, p[i]-p[idx-1] | f(rem-1, i+1)); 
    }
 
    return res; 
}
 
signed main () {
    int a, b; 
 
    scanf("%d%d%d", &n, &a, &b); 
    for(int i=1; i<=n; i++) {
        ll y; scanf("%lld", &y); 
        p[i] = p[i-1] + y; 
    }
 
    ll ans = INF; 
    memset(dp, -1, sizeof dp); 
    for(int i=a; i<=b; i++) {
        ans = min(ans, f(i, 0)); 
        //cout << i << " " << f(i, 0) << endl; 
    }
 
    printf("%lld", ans); 
}
 
/*
YES
3 1 3 
YES
1 
NO
YES
5 5 4 1 4 5 
*/

Compilation message

sculpture.cpp: In function 'll f(int, int)':
sculpture.cpp:25:28: warning: suggest parentheses around arithmetic in operand of '|' [-Wparentheses]
   25 |         res = min(res, p[i]-p[idx-1] | f(rem-1, i+1));
      |                        ~~~~^~~~~~~~~
sculpture.cpp: In function 'int main()':
sculpture.cpp:34:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |     scanf("%d%d%d", &n, &a, &b);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:36:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         ll y; scanf("%lld", &y);
      |               ~~~~~^~~~~~~~~~~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 31692 KB Output is correct
2 Correct 12 ms 31692 KB Output is correct
3 Correct 12 ms 31692 KB Output is correct
4 Correct 14 ms 31820 KB Output is correct
5 Correct 12 ms 31692 KB Output is correct
6 Correct 12 ms 31692 KB Output is correct
7 Correct 12 ms 31784 KB Output is correct
8 Correct 13 ms 31696 KB Output is correct
9 Correct 12 ms 31672 KB Output is correct
10 Correct 12 ms 31692 KB Output is correct
11 Correct 12 ms 31740 KB Output is correct
12 Correct 12 ms 31692 KB Output is correct
13 Correct 12 ms 31692 KB Output is correct
14 Correct 12 ms 31684 KB Output is correct
15 Incorrect 12 ms 31732 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 31684 KB Output is correct
2 Correct 12 ms 31712 KB Output is correct
3 Correct 13 ms 31692 KB Output is correct
4 Correct 13 ms 31692 KB Output is correct
5 Correct 16 ms 31692 KB Output is correct
6 Correct 14 ms 31644 KB Output is correct
7 Correct 12 ms 31680 KB Output is correct
8 Correct 13 ms 31760 KB Output is correct
9 Correct 12 ms 31692 KB Output is correct
10 Correct 14 ms 31692 KB Output is correct
11 Correct 13 ms 31680 KB Output is correct
12 Correct 13 ms 31664 KB Output is correct
13 Correct 13 ms 31728 KB Output is correct
14 Correct 14 ms 31656 KB Output is correct
15 Incorrect 13 ms 31692 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 31716 KB Output is correct
2 Correct 14 ms 31672 KB Output is correct
3 Correct 12 ms 31744 KB Output is correct
4 Correct 12 ms 31692 KB Output is correct
5 Correct 13 ms 31820 KB Output is correct
6 Correct 13 ms 31676 KB Output is correct
7 Correct 15 ms 31664 KB Output is correct
8 Correct 13 ms 31692 KB Output is correct
9 Correct 13 ms 31664 KB Output is correct
10 Correct 12 ms 31652 KB Output is correct
11 Correct 14 ms 31692 KB Output is correct
12 Correct 13 ms 31768 KB Output is correct
13 Correct 13 ms 31692 KB Output is correct
14 Correct 12 ms 31692 KB Output is correct
15 Correct 12 ms 31692 KB Output is correct
16 Correct 13 ms 31664 KB Output is correct
17 Correct 12 ms 31692 KB Output is correct
18 Correct 12 ms 31692 KB Output is correct
19 Correct 13 ms 31688 KB Output is correct
20 Correct 12 ms 31692 KB Output is correct
21 Correct 13 ms 31692 KB Output is correct
22 Correct 13 ms 31672 KB Output is correct
23 Correct 13 ms 31708 KB Output is correct
24 Correct 14 ms 31736 KB Output is correct
25 Correct 15 ms 31692 KB Output is correct
26 Correct 13 ms 31668 KB Output is correct
27 Correct 14 ms 31684 KB Output is correct
28 Correct 15 ms 31692 KB Output is correct
29 Correct 16 ms 31656 KB Output is correct
30 Correct 12 ms 31692 KB Output is correct
31 Correct 13 ms 31748 KB Output is correct
32 Correct 15 ms 31772 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 31660 KB Output is correct
2 Correct 13 ms 31692 KB Output is correct
3 Correct 12 ms 31724 KB Output is correct
4 Correct 14 ms 31692 KB Output is correct
5 Correct 12 ms 31692 KB Output is correct
6 Correct 13 ms 31692 KB Output is correct
7 Correct 12 ms 31656 KB Output is correct
8 Correct 13 ms 31692 KB Output is correct
9 Correct 12 ms 31692 KB Output is correct
10 Correct 12 ms 31716 KB Output is correct
11 Correct 13 ms 31736 KB Output is correct
12 Correct 12 ms 31712 KB Output is correct
13 Correct 13 ms 31692 KB Output is correct
14 Correct 13 ms 31692 KB Output is correct
15 Incorrect 13 ms 31664 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 31656 KB Output is correct
2 Correct 13 ms 31692 KB Output is correct
3 Correct 13 ms 31660 KB Output is correct
4 Correct 12 ms 31684 KB Output is correct
5 Correct 13 ms 31692 KB Output is correct
6 Correct 13 ms 31712 KB Output is correct
7 Correct 13 ms 31692 KB Output is correct
8 Correct 13 ms 31660 KB Output is correct
9 Correct 13 ms 31692 KB Output is correct
10 Correct 13 ms 31692 KB Output is correct
11 Correct 13 ms 31664 KB Output is correct
12 Correct 14 ms 31692 KB Output is correct
13 Correct 14 ms 31692 KB Output is correct
14 Correct 12 ms 31636 KB Output is correct
15 Correct 13 ms 31728 KB Output is correct
16 Correct 14 ms 31692 KB Output is correct
17 Correct 13 ms 31692 KB Output is correct
18 Correct 13 ms 31732 KB Output is correct
19 Correct 12 ms 31692 KB Output is correct
20 Correct 13 ms 31680 KB Output is correct
21 Correct 13 ms 31760 KB Output is correct
22 Correct 12 ms 31700 KB Output is correct
23 Correct 12 ms 31660 KB Output is correct
24 Correct 14 ms 31656 KB Output is correct
25 Correct 13 ms 31752 KB Output is correct
26 Correct 12 ms 31660 KB Output is correct
27 Correct 12 ms 31668 KB Output is correct
28 Correct 12 ms 31692 KB Output is correct
29 Correct 14 ms 31648 KB Output is correct
30 Correct 14 ms 31668 KB Output is correct
31 Correct 13 ms 31740 KB Output is correct
32 Correct 12 ms 31660 KB Output is correct
33 Correct 13 ms 31692 KB Output is correct
34 Correct 13 ms 31716 KB Output is correct
35 Correct 12 ms 31692 KB Output is correct
36 Correct 13 ms 31692 KB Output is correct
37 Correct 14 ms 31768 KB Output is correct
38 Correct 15 ms 31692 KB Output is correct
39 Correct 15 ms 31692 KB Output is correct
40 Correct 15 ms 31732 KB Output is correct
41 Correct 14 ms 31756 KB Output is correct
42 Correct 15 ms 31756 KB Output is correct
43 Incorrect 13 ms 31692 KB Output isn't correct
44 Halted 0 ms 0 KB -