| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 705184 | Alihan_8 | Bali Sculptures (APIO15_sculpture) | C++17 | 15 ms | 6752 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
const int N = 2e3+1;
int dp[51][51][N];
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, A, B; cin >> n >> A >> B;
vector <int> p(n);
for ( auto &i: p ) cin >> i;
dp[0][0][0] = 1;
for ( int i = 0; i < n; i++ ){
for ( int k = 0; k < n; k++ ){
for ( int Or = 0; Or < N; Or++ ){
int cnt = 0;
if ( !dp[i][k][Or] ) continue;
for ( int j = i+1; j <= n; j++ ){
cnt += p[j-1];
dp[j][k+1][cnt | Or] = true;
}
}
}
}
int Mn = N+1;
for ( int i = A; i <= B; i++ ){
for ( int Or = 0; Or < N; Or++ ){
if ( dp[n][i][Or] ) Mn = min(Mn, Or);
}
}
cout << Mn;
cout << '\n';
}
/*
6 1 3
8 1 2 1 5 4
*/
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... | ||||
