Submission #573076

#	Time	Username	Problem	Language	Result	Execution time	Memory
573076		MohamedFaresNebili	Uplifting Excursion (BOI22_vault)	C++14	0 / 100	69 ms	8788 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
		#define int ll
 
        const int oo = 1e9 + 7;
 
        int N, M, A[1000];
        int DP[105][5005];
        int solve(int i, int state) {
            if(i == 2 * N + 1) {
                if(state == M) return 0;
                return -oo;
            }
            if(DP[i][state] != -1)
                return DP[i][state];
            int best = -oo;
            for(int l = 0; l <= A[i]; l++) {
              	int calc = solve(i + 1, state + l * (i - N));
              	if(calc != -oo)
               		 best = max(best,
                    	l + solve(i + 1, state + l * (i - N)));
            }
            return DP[i][state] = best;
        }
 
        int32_t main() {
            ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
            cin >> N >> M; memset(DP, -1, sizeof DP);
            for(int l = 0; l <= 2 * N; l++) cin >> A[l];
            int ans = solve(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