| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1350971 | eyadooz | Bali Sculptures (APIO15_sculpture) | C++20 | 0 ms | 344 KiB |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
#define endl '\n'
#define int long long
main()
{
cin.tie(0) -> sync_with_stdio(0);
int n, asd, b;
cin >> n >> asd >> b;
int dp[n+5][n+5]={};
int a[n+5], pref[n+5]={};
for(int i = 1;i <= n;i++) {cin >> a[i];pref[i]=pref[i-1]+a[i];}
for(int i = 0;i <= n;i++) for(int j = 0;j<=n;j++) dp[i][j]=LONG_LONG_MAX;
dp[0][0]=0;
for(int i = 1;i <= n;i++)
{
for(int x = 1;x<=i;x++)
{
for(int j=0;j<i;j++)
{
if(dp[j][x-1]==LONG_LONG_MAX) continue;
int f=pref[i]-pref[j];
dp[i][x]=min(dp[i][x], dp[j][x-1]|f);
}
}
}
int mn=LONG_LONG_MAX;
for(int i = asd;i <= b;i++) mn=min(mn, dp[n][i]);
cout << mn;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
