제출 #582872

#제출 시각아이디문제언어결과실행 시간메모리
582872Justin1Bali Sculptures (APIO15_sculpture)C++14
9 / 100
1094 ms340 KiB
#include <bits/stdc++.h> #define ll long long using namespace std; ll n,m,k,x,y,z; ll mn[2005]; ll a,b,ar[2005]; void exhaust(ll id, ll ttl, ll sum, ll cut) { if (id > n) { mn[cut] = min(mn[cut],ttl | sum); return; } exhaust(id+1,ttl,sum+ar[id],cut); if (id != 1) exhaust(id+1,ttl | sum,ar[id],cut+1); } signed main() { cin >> n >> a >> b; for (int i = 1; i <= n; i++) mn[i] = LLONG_MAX; for (int i = 1; i <= n; i++) cin >> ar[i]; exhaust(1,0,0,1); ll ans = LLONG_MAX; for (int i = a; i <= b; i++) ans = min(ans,mn[i]); cout << ans << "\n"; }
#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...