Submission #582870

#TimeUsernameProblemLanguageResultExecution timeMemory
582870Justin1Bali Sculptures (APIO15_sculpture)C++14
0 / 100
1084 ms340 KiB
#include <bits/stdc++.h> using namespace std; int n,m,k,x,y,z; int mn[2005]; int a,b,ar[2005]; void exhaust(int id, int ttl, int sum, int 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); } int main() { cin >> n >> a >> b; for (int i = 1; i <= n; i++) mn[i] = INT_MAX; for (int i = 1; i <= n; i++) cin >> ar[i]; exhaust(1,0,0,1); int ans = INT_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...