oj.uz

Submission #110271

# Submission time Handle Problem Language Result Execution time Memory
110271 2019-05-10T12:39:39 Z tc_abd Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 1000 ms 512 KB 
#include <bits/stdc++.h>
using namespace std;
int n,a,b,mn=1000000009;
int arr[50];
void bt(int id,int sum,int curr,int flag){
    if(id == n){
        if(flag < a || flag > b || sum) return;
        mn = min(mn,curr); return;
    }
    sum += arr[id];
    bt(id+1,sum,curr,flag);
    curr |= sum;
    bt(id+1,0,curr,flag+1);
}
int main(){
    cin>>n>>a>>b;
    for(int i=0;i<n;i++) cin>>arr[i];
    bt(0,0,0,0);
    cout<<mn<<endl;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 7 ms 256 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 8 ms 384 KB Output is correct
11 Correct 7 ms 256 KB Output is correct
12 Correct 8 ms 384 KB Output is correct
13 Correct 7 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 6 ms 384 KB Output is correct
19 Correct 3 ms 300 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 7 ms 384 KB Output is correct
22 Correct 7 ms 360 KB Output is correct
23 Correct 10 ms 384 KB Output is correct
24 Correct 9 ms 384 KB Output is correct
25 Correct 8 ms 256 KB Output is correct
26 Correct 9 ms 384 KB Output is correct
27 Incorrect 3 ms 256 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 8 ms 256 KB Output is correct
9 Correct 8 ms 384 KB Output is correct
10 Correct 7 ms 384 KB Output is correct
11 Correct 7 ms 256 KB Output is correct
12 Correct 11 ms 256 KB Output is correct
13 Correct 9 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 3 ms 256 KB Output is correct
21 Correct 6 ms 384 KB Output is correct
22 Correct 8 ms 384 KB Output is correct
23 Correct 10 ms 384 KB Output is correct
24 Correct 8 ms 384 KB Output is correct
25 Correct 10 ms 256 KB Output is correct
26 Correct 7 ms 384 KB Output is correct
27 Correct 20 ms 384 KB Output is correct
28 Correct 141 ms 256 KB Output is correct
29 Execution timed out 1067 ms 384 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 8 ms 256 KB Output is correct
9 Correct 8 ms 384 KB Output is correct
10 Correct 8 ms 384 KB Output is correct
11 Correct 10 ms 256 KB Output is correct
12 Correct 7 ms 384 KB Output is correct
13 Correct 7 ms 512 KB Output is correct
14 Correct 12 ms 384 KB Output is correct
15 Correct 191 ms 504 KB Output is correct
16 Execution timed out 1071 ms 256 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 8 ms 256 KB Output is correct
9 Correct 7 ms 256 KB Output is correct
10 Correct 6 ms 256 KB Output is correct
11 Correct 7 ms 384 KB Output is correct
12 Correct 8 ms 384 KB Output is correct
13 Correct 11 ms 256 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 11 ms 384 KB Output is correct
22 Correct 6 ms 384 KB Output is correct
23 Correct 7 ms 384 KB Output is correct
24 Correct 6 ms 256 KB Output is correct
25 Correct 7 ms 384 KB Output is correct
26 Correct 7 ms 384 KB Output is correct
27 Incorrect 3 ms 384 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 8 ms 384 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 9 ms 384 KB Output is correct
9 Correct 8 ms 384 KB Output is correct
10 Correct 7 ms 384 KB Output is correct
11 Correct 13 ms 256 KB Output is correct
12 Correct 11 ms 384 KB Output is correct
13 Correct 9 ms 384 KB Output is correct
14 Incorrect 2 ms 256 KB Output isn't correct
15 Halted 0 ms 0 KB -