Submission #849894

# Submission time Handle Problem Language Result Execution time Memory
849894 2023-09-15T14:17:05 Z MinaRagy06 Uplifting Excursion (BOI22_vault) C++17
0 / 100
5000 ms 112080 KB
#include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;

int m;
ll l, a[605];
map<ll, ll> mem[605];
ll solve(int i, ll s) {
    if (i == 2 * m + 1) {
        if (s == l) return 0;
        return -1e18;
    }
    if (mem[i].find(s) != mem[i].end()) {
        return mem[i][s];
    }
    ll ans = -1e18;
    for (int j = 0; j <= a[i]; j++) {
        ans = max(ans, j + solve(i + 1, s + j * (i - m)));
    }
    return mem[i][s] = ans;
}
int main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    cin >> m >> l;
    for (int i = 0; i < 2 * m + 1; i++) {
        cin >> a[i];
    }
    ll ans = solve(0, 0);
    if (ans < 0) {
        cout << "impossible\n";
    } else {
        cout << ans << '\n';
    }
    return 0;
}

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Execution timed out 5021 ms 74748 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Execution timed out 5021 ms 74748 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Execution timed out 5031 ms 112080 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Execution timed out 5031 ms 112080 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Execution timed out 5031 ms 112080 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Execution timed out 5021 ms 74748 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Execution timed out 5031 ms 112080 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Execution timed out 5021 ms 74748 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Execution timed out 5031 ms 112080 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Execution timed out 5021 ms 74748 KB Time limit exceeded
6 Halted 0 ms 0 KB -