제출 #949631

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
949631		ifateen	Uplifting Excursion (BOI22_vault)	C++17	5 / 100	2466 ms	8284 KiB

vault

#include <bits/stdc++.h>
using namespace std;
#define int long long
int OFFSET, OFFSET_SUM;
int dp[2][250'005];

signed main() {
    int n, l;
    cin >> n >> l;
    vector<int> v(2 * n + 1);
    for (auto& i : v) cin >> i;
    OFFSET = n, OFFSET_SUM = n * 50 * 50;
    if (l > OFFSET_SUM || l < -OFFSET_SUM) {
        cout << "impossible";
        return 0;
    }
    for (int i = 0; i <= 2 * OFFSET_SUM; ++i) dp[0][i] = dp[1][i] = -1e9;
    dp[1][OFFSET_SUM] = 0;
    for (int i = 0; i <= 2 * n; ++i) {
        int actual_value = i - OFFSET;
        for (int j = 0; j <= OFFSET_SUM * 2; ++j) {
            dp[i & 1][j] = max(dp[i & 1][j], dp[i & 1 ^ 1][j]);
            for (int k = 1; k <= v[i]; ++k) {
                int prv_sum = j - k * actual_value;
                if (prv_sum < 0 || prv_sum > OFFSET_SUM * 2) continue;
                dp[i & 1][j] = max(dp[i & 1][j], dp[i & 1 ^ 1][prv_sum] + k);
            }
        }
    }
    int ans = dp[0][OFFSET_SUM + l];
    if (ans <= 0) cout << "impossible";
    else cout << ans;
}

컴파일 시 표준 에러 (stderr) 메시지

vault.cpp: In function 'int main()':
vault.cpp:22:51: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   22 |             dp[i & 1][j] = max(dp[i & 1][j], dp[i & 1 ^ 1][j]);
      |                                                 ~~^~~
vault.cpp:26:55: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   26 |                 dp[i & 1][j] = max(dp[i & 1][j], dp[i & 1 ^ 1][prv_sum] + k);
      |                                                     ~~^~~

• Subtask 1: 5 / 5
• Subtask 2: 0 / 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