oj.uz

Submission #882847

# Submission time Handle Problem Language Result Execution time Memory
882847 2023-12-03T21:20:48 Z OAleksa Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 1 ms 348 KB 
#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define int long long
const int maxn = 110;
const int inf = 1e18;
int dp[maxn][maxn], a[maxn], l, r, n;
signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--) {
   	cin >> n >> l >> r;
   	for (int i = 1;i <= n;i++)
   		cin >> a[i];
   	for (int i = 0;i <= n;i++) {
   		for (int j = 0;j <= n;j++)
   			dp[i][j] = inf;
   	}
   	dp[0][0] = 0;
   	for (int j = 1;j <= n;j++) {
   		for (int i = 1;i <= n;i++) {
   			if (j > i)
   				continue;
   			int sm = a[i];
   			for (int k = i - 1;k >= 0;k--) {
   				dp[i][j] = min(dp[i][j], dp[k][j - 1] | sm);
   				sm += a[k];
   			}
   		}
   	}
   	int ans = inf;
   	for (int i = l;i <= r;i++)
   		ans = min(ans, dp[n][i]);
   	cout << ans;
	}
	return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -