제출 #552588

#제출 시각아이디문제언어결과실행 시간메모리
552588QwertyPiBali Sculptures (APIO15_sculpture)C++14
46 / 100
873 ms262144 KiB
#include <bits/stdc++.h> #define int long long using namespace std; const int N = 2001; int dp[N]; int s[N], A[N]; vector<int> vals[N][N]; int32_t main(){ int n, a, b; cin >> n >> a >> b; vals[0][0].push_back(0); for(int i = 1; i <= n; i++) cin >> A[i], s[i] = s[i - 1] + A[i]; for(int i = 1; i <= n; i++){ for(int k = 1; k <= i; k++){ for(int j = 0; j < i; j++){ for(auto v : vals[j][k - 1]){ vals[i][k].push_back(v | (s[i] - s[j])); } } sort(vals[i][k].begin(), vals[i][k].end()); vals[i][k].resize(unique(vals[i][k].begin(), vals[i][k].end()) - vals[i][k].begin()); } // for(auto j : vals[i]) cout << j << ' '; cout << endl; } int ans = (1LL << 60); for(int i = a; i <= b; i++){ ans = min(ans, vals[n][i].front()); } cout << ans << endl; }
#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...