Submission #1085493

#TimeUsernameProblemLanguageResultExecution timeMemory
1085493minggaBali Sculptures (APIO15_sculpture)C++17
9 / 100
34 ms608 KiB
#include "bits/stdc++.h" using namespace std; #define ln "\n" #define dbg(x) cout << #x << " = " << x << ln #define mp make_pair #define pb push_back #define fi first #define se second #define inf 2e18 #define fast_cin() \ ios_base::sync_with_stdio(false); \ cin.tie(NULL) #define out(file) freopen(file, "w", stdout) #define in(file) freopen(file, "r", stdin) #define all(x) (x).begin(), (x).end() #define sz(x) ((int)(x).size()) #define ll long long int MOD = 1e9 + 7; const int N = 2001; int y[N], a, b, n; ll ps[N], dp[N][N]; void sub1() { ll ans = inf; for(int mask = 0; mask < (1 << n); mask++) { if(((mask >> (n-1)) & 1) == 0) continue; int cnt = __builtin_popcount(mask); if(cnt < a or cnt > b) continue; ll s = 0; ll cur = 0; // cerr << "CNT " << cnt << ln; for(int i = 0; i < n; i++) { s += y[i+1]; if((mask >> i) & 1) { cur |= s; // cerr << s << ' '; s = 0; } } // cerr << ln; ans = min(ans, cur); } cout << ans; } signed main() { fast_cin(); cin >> n >> a >> b; for(int i = 1; i <= n; i++) cin >> y[i], ps[i] = ps[i-1] + y[i]; if(n <= 20) sub1(); cerr << "\nTime: " << clock() * 1000 / CLOCKS_PER_SEC; }
#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...