oj.uz

Submission #721664

# Submission time Handle Problem Language Result Execution time Memory
721664 2023-04-11T06:24:05 Z dxz05 Uplifting Excursion (BOI22_vault) C++17
5 / 100
 5000 ms 4356 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
#define all(x) (x).begin(), (x).end()
#define MP make_pair
const int N = 100500;

const int LIM = 100 * 100 * 101 / 2 + 1;

vector<int> knapsack(vector<int> a){
    vector<int> dp(LIM, -1e9);
    dp[0] = 0;

    for (int x : a) {
        for (int i = LIM - 1; i >= x; i--) {
            dp[i] = max(dp[i], dp[i - x] + 1);
        }
    }

    return dp;
}

void solve(){
    int m; ll L;
    cin >> m >> L;

    if (L >= LIM || L <= -LIM){
        cout << "impossible" << endl;
        return;
    }

    vector<int> pos, neg;
    for (int i = -m; i <= m; i++){
        int x;
        cin >> x;
        while (x--){
            if (i >= 0){
                pos.push_back(i);
            } else {
                neg.push_back(-i);
            }
        }
    }

    vector<int> dp1 = knapsack(pos);
    vector<int> dp2 = knapsack(neg);

    if (L < 0){
        L = -L;
        swap(dp1, dp2);
    }

    int ans = -1e9;
    for (int x = L; x < LIM; x++) {
        int y = x - L;
        ans = max(ans, dp1[x] + dp2[y]);
    }

    if (ans < 0) {
        cout << "impossible" << endl;
    } else {
        cout << ans << endl;
    }
}

int main() {
    ios_base::sync_with_stdio(false);

#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    solve();

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4180 KB Output is correct
2 Correct 9 ms 4180 KB Output is correct
3 Correct 6 ms 4264 KB Output is correct
4 Correct 29 ms 4220 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1132 ms 4292 KB Output is correct
7 Correct 456 ms 4344 KB Output is correct
8 Correct 1101 ms 4232 KB Output is correct
9 Correct 2009 ms 4312 KB Output is correct
10 Correct 51 ms 4224 KB Output is correct
11 Correct 38 ms 4220 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4180 KB Output is correct
2 Correct 9 ms 4180 KB Output is correct
3 Correct 6 ms 4264 KB Output is correct
4 Correct 29 ms 4220 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1132 ms 4292 KB Output is correct
7 Correct 456 ms 4344 KB Output is correct
8 Correct 1101 ms 4232 KB Output is correct
9 Correct 2009 ms 4312 KB Output is correct
10 Correct 51 ms 4224 KB Output is correct
11 Correct 38 ms 4220 KB Output is correct
12 Correct 7 ms 4180 KB Output is correct
13 Correct 6 ms 4180 KB Output is correct
14 Correct 8 ms 4228 KB Output is correct
15 Correct 37 ms 4216 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1149 ms 4288 KB Output is correct
18 Correct 450 ms 4220 KB Output is correct
19 Correct 1105 ms 4296 KB Output is correct
20 Correct 1939 ms 4308 KB Output is correct
21 Correct 52 ms 4224 KB Output is correct
22 Correct 40 ms 4224 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 4677 ms 4348 KB Output is correct
25 Correct 1547 ms 4300 KB Output is correct
26 Execution timed out 5034 ms 4356 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 4204 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 4204 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 4204 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4180 KB Output is correct
2 Correct 9 ms 4180 KB Output is correct
3 Correct 6 ms 4264 KB Output is correct
4 Correct 29 ms 4220 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1132 ms 4292 KB Output is correct
7 Correct 456 ms 4344 KB Output is correct
8 Correct 1101 ms 4232 KB Output is correct
9 Correct 2009 ms 4312 KB Output is correct
10 Correct 51 ms 4224 KB Output is correct
11 Correct 38 ms 4220 KB Output is correct
12 Correct 33 ms 4204 KB Output is correct
13 Incorrect 0 ms 212 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 4204 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4180 KB Output is correct
2 Correct 9 ms 4180 KB Output is correct
3 Correct 6 ms 4264 KB Output is correct
4 Correct 29 ms 4220 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1132 ms 4292 KB Output is correct
7 Correct 456 ms 4344 KB Output is correct
8 Correct 1101 ms 4232 KB Output is correct
9 Correct 2009 ms 4312 KB Output is correct
10 Correct 51 ms 4224 KB Output is correct
11 Correct 38 ms 4220 KB Output is correct
12 Correct 7 ms 4180 KB Output is correct
13 Correct 6 ms 4180 KB Output is correct
14 Correct 8 ms 4228 KB Output is correct
15 Correct 37 ms 4216 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1149 ms 4288 KB Output is correct
18 Correct 450 ms 4220 KB Output is correct
19 Correct 1105 ms 4296 KB Output is correct
20 Correct 1939 ms 4308 KB Output is correct
21 Correct 52 ms 4224 KB Output is correct
22 Correct 40 ms 4224 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 4677 ms 4348 KB Output is correct
25 Correct 1547 ms 4300 KB Output is correct
26 Execution timed out 5034 ms 4356 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 4204 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4180 KB Output is correct
2 Correct 9 ms 4180 KB Output is correct
3 Correct 6 ms 4264 KB Output is correct
4 Correct 29 ms 4220 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1132 ms 4292 KB Output is correct
7 Correct 456 ms 4344 KB Output is correct
8 Correct 1101 ms 4232 KB Output is correct
9 Correct 2009 ms 4312 KB Output is correct
10 Correct 51 ms 4224 KB Output is correct
11 Correct 38 ms 4220 KB Output is correct
12 Correct 7 ms 4180 KB Output is correct
13 Correct 6 ms 4180 KB Output is correct
14 Correct 8 ms 4228 KB Output is correct
15 Correct 37 ms 4216 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1149 ms 4288 KB Output is correct
18 Correct 450 ms 4220 KB Output is correct
19 Correct 1105 ms 4296 KB Output is correct
20 Correct 1939 ms 4308 KB Output is correct
21 Correct 52 ms 4224 KB Output is correct
22 Correct 40 ms 4224 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 4677 ms 4348 KB Output is correct
25 Correct 1547 ms 4300 KB Output is correct
26 Execution timed out 5034 ms 4356 KB Time limit exceeded
27 Halted 0 ms 0 KB -