Submission #1026742

#	Time	Username	Problem	Language	Result	Execution time	Memory
1026742		gyg	Uplifting Excursion (BOI22_vault)	C++17	5 / 100	5098 ms	8264 KiB

vault

#pragma GCC optimize("O3", "Ofast", "unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>    
using namespace std;
#define int long long
const int OFFSET = 5e5, INF = 1e9;
 
int n, tar;
unordered_map<int, int> t;
 
array<int, 2 * OFFSET + 5> dp;
void comp() {
    fill(dp.begin(), dp.end(), -INF);
    dp[OFFSET] = 0;
    for (int x = -n; x <= n; x++) {
        for (int i = 1; i <= t[x]; i++) {
            if (x >= 0) {
                for (int y = OFFSET; y >= -OFFSET; y--)
                    if (-OFFSET <= y - x && y - x <= OFFSET) dp[y + OFFSET] = max(dp[y + OFFSET], dp[y - x + OFFSET] + 1);
            } else {
                for (int y = -OFFSET; y <= OFFSET; y++)
                    if (-OFFSET <= y - x && y - x <= OFFSET) dp[y + OFFSET] = max(dp[y + OFFSET], dp[y - x + OFFSET] + 1);
            }

        }
    }
}
 
signed main() {
    // freopen("vault.in", "r", stdin);
    cin >> n >> tar;
    if (tar < -OFFSET || tar > OFFSET) { cout << "impossible" << '\n'; exit(0); }
    for (int i = -n; i <= n; i++) cin >> t[i];
 
    comp();
 
    cout << ((dp[tar + OFFSET] < 0) ? "impossible" : to_string(dp[tar + OFFSET])) << '\n';
    
}
 

• 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