Submission #1155168

#	Time	Username	Problem	Language	Result	Execution time	Memory
1155168		Sang	Bali Sculptures (APIO15_sculpture)	C++20	50 / 100	59 ms	780 KiB

sculpture

#include<bits/stdc++.h>
using namespace std;

#define int long long
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define fi first
#define se second
#define pb push_back
#define ALL(a) (a).begin(), (a).end()
#define task "kbsiudthw"

typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<int, ii> pii;

const int N = 1e5 + 5;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 2277;

int n, A, B, a[2005], ans, nAns;
int dp[2005];

bool check(int x){
    int limit = (1ll<<x);
    dp[0] = 0;
    FOR (i, 1, n){
        dp[i] = INF;
        FORD(j, i-1, 0){
            int s = (a[i] - a[j]);
            if ((s & nAns) == 0) dp[i] = min(dp[i], dp[j]+1);
        }
    }
    return dp[n] <= B ;
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")){
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    cin >> n >> A >> B;
    FOR (i, 1, n) cin >> a[i], a[i] += a[i-1];
    int k = log2(a[n]);
    //cout << check(4) << '\n';
    FORD(i, k, 0){
        nAns += (1ll<<i);
        if (!check(i)){
            ans += (1ll<<i);
            nAns -= (1ll<<i);
        }
    }
    cout << ans;

    return 0;
}

Compilation message (stderr)

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

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