Submission #552584

#TimeUsernameProblemLanguageResultExecution timeMemory
552584QwertyPiBali Sculptures (APIO15_sculpture)C++14
0 / 100
1 ms360 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];
int32_t main(){
	int n, a, b;
	cin >> n >> a >> b;
	vals[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++){
		if(i >= a){
			for(int j = max(0LL, i - b); j <= i - a; j++){
				for(auto v : vals[j]){
					vals[i].push_back(v | (s[i] - s[j]));
				}
			}
		}
		sort(vals[i].begin(), vals[i].end());
		vals[i].resize(unique(vals[i].begin(), vals[i].end()) - vals[i].begin());
		// for(auto j : vals[i]) cout << j << ' '; cout << endl;
	}
	cout << vals[n].front() << 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...