oj.uz

답안 #298608

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
298608 2020-09-13T14:15:18 Z Ruba_K Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 1 ms 512 KB 
#include<bits/stdc++.h>

using namespace std;

#define debug(x) cout << '[' << #x << " is: " << x << "] " << endl;
#define imod(a , n) (a % n + n ) % n

#define fastio ios_base::sync_with_stdio(false);cin.tie(0);
#define inF freopen("input.txt","r",stdin );
#define outF freopen("output.txt" , "w" , stdout ) ;
#define sor(v) sort(v.begin() , v.end());
#define print(v) for(auto f : v ) cout << f << " " ;
#define rsor(v) sort(v.rbegin() , v.rend());
#define rev(v) reverse(v.begin() , v.end());
#define lp(i , n) for(int x = i ; x < n ; x ++)
#define ll long long
#define read(arr , x , n) for(int i = x ; i < n ; i ++ )cin >> arr[i];
#define vector deque
const double eps = 1e-6, PI = acos(-1) ;
const long long OO = 1e18 ;
const ll N = 2e3 + 3 , oo = 1e9 + 1, M = 2000002, mod = 1e9 + 7, K = 12;
const int di[] = {1, -1, 0, 0 , 1 , 1 , -1 , -1};
const int dj[] = {0, 0, 1, -1 , 1 , -1 , 1 , -1};

int n , a , b , arr[N];

int invalid = oo;
ll calc(int idx , int rest , ll sum  ){//cout << idx << " " << rest <<  " " << sum << endl ;
    if(n - idx <= rest)
        return invalid ;


    if(rest == 0){
        ll ret = 0 ;
        while(idx < n)ret += arr[idx ++];
        return ret ;
    }

    ll first = OO , second ;

    first = sum | calc(idx + 1 , rest - 1 , arr[idx + 1]);
    //cout << sum << " " ;debug(first);
    second = calc(idx + 1 , rest , sum + arr[idx + 1]);


    return min(first , second);



}
int32_t main()
{
     //inF;outF;
    fastio;
    // Dont Forget memset
    cin >> n >> a >> b ;

    for(int i = 0 ;i < n ; i ++)
        cin >> arr[i];


    ll mnans = OO ;

    while(a <= b){
        mnans = min(mnans , calc(0 , a , arr[0]));
        //debug(mnans);
        //break;
        a ++ ;
    }

    cout << mnans ;

}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Incorrect 1 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Incorrect 1 ms 512 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Incorrect 1 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Incorrect 1 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Incorrect 1 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -