oj.uz

Submission #110275

# Submission time Handle Problem Language Result Execution time Memory
110275 2019-05-10T12:46:26 Z _demon_ Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 1000 ms 504 KB 
#include <bits/stdc++.h>
using namespace std;
long long n,a,b;
long long arr[29];
vector<int>vv;
long long bt(int id,vector<int>v){
    if(id==n){
        if(v.size()+1>b || v.size()+1<a) return 1000000000009ll;
        bool done[29]={0};
        for(int i=0;i<v.size();i++){
            done[v[i]]=1;
        }
        long long all=0;
        long long sum=0;
        for(int i=0;i<n;i++){
            sum+=arr[i];
            if(done[i]){
                all|=sum;
                sum=0;
            }
        }
        all|=sum;
        /*if(all==11){
            for(int i=0;i<v.size();i++){
                cout<<v[i]<<" ";
            }
            cout<<endl;
        }*/
        return all;
    }
    long long ans=1000000000009ll;
    ans=min(ans,bt(id+1,v));
    v.push_back(id);
    ans=min(ans,bt(id+1,v));
    return ans;
}
int main(){
 cin>>n>>a>>b;
    for(int i=0;i<n;i++)cin>>arr[i];
    cout<<bt(0,vv)<<endl;
}

Compilation message

sculpture.cpp: In function 'long long int bt(int, std::vector<int>)':
sculpture.cpp:8:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(v.size()+1>b || v.size()+1<a) return 1000000000009ll;
            ~~~~~~~~~~^~
sculpture.cpp:8:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(v.size()+1>b || v.size()+1<a) return 1000000000009ll;
                            ~~~~~~~~~~^~
sculpture.cpp:10:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0;i<v.size();i++){
                     ~^~~~~~~~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 8 ms 384 KB Output is correct
7 Correct 18 ms 384 KB Output is correct
8 Correct 125 ms 504 KB Output is correct
9 Correct 125 ms 476 KB Output is correct
10 Correct 156 ms 392 KB Output is correct
11 Correct 146 ms 384 KB Output is correct
12 Correct 138 ms 396 KB Output is correct
13 Correct 227 ms 504 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Incorrect 2 ms 384 KB Output isn't correct
16 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 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 8 ms 384 KB Output is correct
7 Correct 21 ms 400 KB Output is correct
8 Correct 154 ms 376 KB Output is correct
9 Correct 199 ms 384 KB Output is correct
10 Correct 128 ms 504 KB Output is correct
11 Correct 147 ms 256 KB Output is correct
12 Correct 126 ms 396 KB Output is correct
13 Correct 250 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Incorrect 2 ms 256 KB Output isn't correct
16 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 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 7 ms 256 KB Output is correct
7 Correct 20 ms 256 KB Output is correct
8 Correct 133 ms 256 KB Output is correct
9 Correct 144 ms 376 KB Output is correct
10 Correct 162 ms 356 KB Output is correct
11 Correct 143 ms 360 KB Output is correct
12 Correct 135 ms 356 KB Output is correct
13 Correct 182 ms 256 KB Output is correct
14 Correct 429 ms 364 KB Output is correct
15 Execution timed out 1071 ms 256 KB Time limit exceeded
16 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 3 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 9 ms 256 KB Output is correct
7 Correct 18 ms 256 KB Output is correct
8 Correct 153 ms 360 KB Output is correct
9 Correct 155 ms 384 KB Output is correct
10 Correct 140 ms 256 KB Output is correct
11 Correct 190 ms 356 KB Output is correct
12 Correct 161 ms 256 KB Output is correct
13 Correct 209 ms 396 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Incorrect 2 ms 384 KB Output isn't correct
16 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 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 8 ms 428 KB Output is correct
7 Correct 17 ms 384 KB Output is correct
8 Correct 123 ms 384 KB Output is correct
9 Correct 144 ms 384 KB Output is correct
10 Correct 134 ms 396 KB Output is correct
11 Correct 203 ms 376 KB Output is correct
12 Correct 160 ms 504 KB Output is correct
13 Correct 256 ms 392 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 79 ms 384 KB Output is correct
18 Correct 184 ms 380 KB Output is correct
19 Correct 169 ms 488 KB Output is correct
20 Correct 207 ms 396 KB Output is correct
21 Correct 245 ms 504 KB Output is correct
22 Correct 158 ms 256 KB Output is correct
23 Correct 218 ms 384 KB Output is correct
24 Correct 481 ms 384 KB Output is correct
25 Execution timed out 1075 ms 384 KB Time limit exceeded
26 Halted 0 ms 0 KB -