oj.uz

답안 #110280

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
110280 2019-05-10T13:08:02 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(v.size()+1>b) return 100000000000009ll;
    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:7:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(v.size()+1>b) return 100000000000009ll;
       ~~~~~~~~~~^~
sculpture.cpp:9:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(v.size()+1>b || v.size()+1<a) return 1000000000009ll;
            ~~~~~~~~~~^~
sculpture.cpp:9:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(v.size()+1>b || v.size()+1<a) return 1000000000009ll;
                            ~~~~~~~~~~^~
sculpture.cpp:11:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0;i<v.size();i++){
                     ~^~~~~~~~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 8 ms 384 KB Output is correct
7 Correct 3 ms 304 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 221 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 #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 460 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 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 10 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 247 ms 384 KB Output is correct
14 Correct 3 ms 256 KB Output is correct
15 Incorrect 2 ms 384 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 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 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 9 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 3 ms 256 KB Output is correct
13 Correct 208 ms 360 KB Output is correct
14 Correct 462 ms 384 KB Output is correct
15 Execution timed out 1071 ms 504 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 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 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 10 ms 384 KB Output is correct
7 Correct 3 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 258 ms 356 KB Output is correct
14 Correct 3 ms 384 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 6 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 8 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 261 ms 360 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 26 ms 256 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 208 ms 256 KB Output is correct
21 Correct 292 ms 384 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 192 ms 384 KB Output is correct
24 Correct 461 ms 364 KB Output is correct
25 Execution timed out 1079 ms 256 KB Time limit exceeded
26 Halted 0 ms 0 KB -