Submission #657091

#	Time	Username	Problem	Language	Result	Execution time	Memory
657091		Lobo	Uplifting Excursion (BOI22_vault)	C++17	20 / 100	3224 ms	524288 KiB

vault

#include<bits/stdc++.h>
using namespace std;
const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

const int maxm = 51;

int n, m, L;

void solve() {
    cin >> m >> L;
    vector<pair<int,int>> vals;
    int sumneg = 0, sumpos = 0;
    for(int i = -m; i <= m; i++) {
        int x; cin >> x;
        if(i > 0) sumpos+= x*i;
        if(i < 0) sumneg-= x*i;

        for(int j = 0; j <= 10; j++) {
            if((1<<j) <= x) {
                x-= (1<<j);
                vals.pb(mp(i*(1<<j),(1<<j)));
            }
        }
        for(int j = 0; j <= 10; j++) {
            if((1<<j)&x) {
                vals.pb(mp(i*(1<<j),(1<<j)));
            }
        }
        // while(x--) vals.pb(mp(i,1));
    }

    if(L > sumpos || L < -sumneg) {
        cout << "impossible" << endl;
        return;
    }

    int n = vals.size();
    int up = sumneg;

    vector<int> dp[2];
    for(int i = -sumneg; i <= sumpos; i++) {
        dp[0].pb(-inf);
        dp[1].pb(-inf);
    }
    dp[0][0+up] = 0;
    for(int i = 1; i <= n; i++) {
        int x = vals[i-1].fr;
        int q = vals[i-1].sc;
        for(int j = -sumneg; j <= sumpos; j++) {
            dp[i&1][j+up] = -inf;
            dp[i&1][j+up] = max(dp[i&1][j+up],dp[i&1^1][j+up]);
            if(j-x >= -sumneg && j-x <= sumpos) dp[i&1][j+up] = max(dp[i&1][j+up],dp[i&1^1][j-x+up]+q);
        }
    }

    if(dp[n&1][L+up] < 0) {
        cout << "impossible" << endl;
    }
    else {
        cout << dp[n&1][L+up] << endl;
    }


}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    // freopen("in.in", "r", stdin);
    // freopen("out.out", "w", stdout);
    int tt = 1;
    // cin >> tt;
    while(tt--) {
        solve();
    }

}

Compilation message (stderr)

vault.cpp: In function 'void solve()':
vault.cpp:60:51: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   60 |             dp[i&1][j+up] = max(dp[i&1][j+up],dp[i&1^1][j+up]);
      |                                                  ~^~
vault.cpp:61:87: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   61 |             if(j-x >= -sumneg && j-x <= sumpos) dp[i&1][j+up] = max(dp[i&1][j+up],dp[i&1^1][j-x+up]+q);
      |                                                                                      ~^~

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3-1: 0 / 10
• Subtask 3-2: 0 / 10
• Subtask 4-1: 0 / 10
• Subtask 4-2: 0 / 10
• Subtask 5-1: 0 / 10
• Subtask 5-2: 0 / 10
• Subtask 6-1: 0 / 10
• Subtask 6-2: 0 / 10