Submission #1253428

#	Time	Username	Problem	Language	Result	Execution time	Memory
1253428		hoa208	Bali Sculptures (APIO15_sculpture)	C++20	0 / 100	15 ms	31816 KiB

sculpture

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORD(i, b, a) for (int i = (b), _a = (a); i >= _a; i--)
#define pa pair<ll, ll>
#define fi first
#define se second
#define bit(mask, j) ((mask >> j) & 1)
#define t_test int t;cin >> t;while(t--)
const   ll mod = 1e9 + 7;
const   ll INF = 1e18;
inline  void adm(ll &x){if(x>=mod)x%=mod;else if(x<0)x+=mod;}
//--------------------------------------------------------------------

const ll N = 2003;
ll w[N], dp[N][N], s[N];
ll get_sum(ll i, ll j) {
    return s[j] - s[i - 1];
}
void hbmt() {
    ll n, a, b;
    cin >> n >> a >> b;
    FOR(i, 1, n) {
        cin >> w[i];
        s[i] = s[i - 1] + w[i];
    }
    memset(dp, 0x3f, sizeof dp);
    dp[0][0] = 0;
    FOR(i, 1, n) {
        FOR(j, 1, b) {
            FOR(u, 0, i - 1) {
                dp[i][j] = min(dp[i][j], dp[u][j - 1] | get_sum(u + 1, i));
            }
        }
    }
    ll ans = INF;
    FOR(i, a, b) ans = min(dp[n][i], ans);
    cout << ans;
}

int main() {
    
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    
    if(fopen("hbmt.inp", "r")) {
        freopen("hbmt.inp", "r", stdin);
        freopen("hbmt.out", "w", stdout);
    }
    
    // t_test 
    hbmt();
    return 0;
}

Compilation message (stderr)

sculpture.cpp: In function 'int main()':
sculpture.cpp:48:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |         freopen("hbmt.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:49:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |         freopen("hbmt.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 9
• Subtask 2: 0 / 16
• Subtask 3: 0 / 21
• Subtask 4: 0 / 25
• Subtask 5: 0 / 29