Submission #572997

#	Time	Username	Problem	Language	Result	Execution time	Memory
572997		MohamedFaresNebili	Uplifting Excursion (BOI22_vault)	C++14	0 / 100	5008 ms	48312 KiB

vault

#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")

        using namespace std;

        using ll = long long;
        using ii = pair<int, int>;
        using vi = vector<int>;

        #define pb push_back
        #define pp pop_back
        #define ff first
        #define ss second
        #define lb lower_bound

        const int oo = 1e9 + 7;

        int N, M, A[1000];
        map<pair<ii, int>, int> DP;
        int solve(int i, int curr, int state) {
            if(i == 2 * N + 1) {
                if(state == M) return curr;
                return -oo;
            }
            if(DP.count({{i, state}, curr}))
                return DP[{{i, state}, curr}];
            int best = -oo;
            for(int l = 0; l <= A[i]; l++)
                best = max(best,
                    solve(i + 1, curr + l, state + l * (i - N)));
            return DP[{{i, state}, curr}] = best;
        }

        int32_t main() {
            ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
            cin >> N >> M;
            for(int l = 0; l <= 2 * N; l++) cin >> A[l];
            int ans = solve(0, 0, 0);
            if(ans == -oo) cout << "impossible\n";
            else cout << ans << "\n";
        }

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