oj.uz

Submission #849898

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

struct chash {
    const ll R = chrono::steady_clock::now().time_since_epoch().count();
    const ll C = ll(4e18 * acos(0)) + 73;
    ll operator()(ll x) {
        return __builtin_bswap64((x^R) * C);
    }
};
int m;
ll l, a[605];
unordered_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;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 3053 ms 143488 KB Output is correct
6 Correct 3512 ms 144796 KB Output is correct
7 Correct 539 ms 55464 KB Output is correct
8 Correct 2713 ms 129656 KB Output is correct
9 Execution timed out 5033 ms 150704 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 3053 ms 143488 KB Output is correct
6 Correct 3512 ms 144796 KB Output is correct
7 Correct 539 ms 55464 KB Output is correct
8 Correct 2713 ms 129656 KB Output is correct
9 Execution timed out 5033 ms 150704 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Runtime error 2778 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Runtime error 2778 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Runtime error 2778 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 3053 ms 143488 KB Output is correct
6 Correct 3512 ms 144796 KB Output is correct
7 Correct 539 ms 55464 KB Output is correct
8 Correct 2713 ms 129656 KB Output is correct
9 Execution timed out 5033 ms 150704 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Runtime error 2778 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 3053 ms 143488 KB Output is correct
6 Correct 3512 ms 144796 KB Output is correct
7 Correct 539 ms 55464 KB Output is correct
8 Correct 2713 ms 129656 KB Output is correct
9 Execution timed out 5033 ms 150704 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Runtime error 2778 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 3053 ms 143488 KB Output is correct
6 Correct 3512 ms 144796 KB Output is correct
7 Correct 539 ms 55464 KB Output is correct
8 Correct 2713 ms 129656 KB Output is correct
9 Execution timed out 5033 ms 150704 KB Time limit exceeded
10 Halted 0 ms 0 KB -