Submission #298620

#TimeUsernameProblemLanguageResultExecution timeMemory
298620SuhaibSawalha1Bali Sculptures (APIO15_sculpture)C++14
0 / 100
1080 ms512 KiB
#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 (idx == n){ return rest ? invalid : sum; } ll ret = oo; if (idx){ ret = min (ret , calc(idx + 1 , rest , sum + arr[idx])); } if (rest){ ret = min (ret , sum | calc(idx + 1 , rest - 1 , arr[idx])); } return ret; } 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 , 0)); //debug(mnans); //break; a ++ ; } cout << mnans ; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...