oj.uz

Submission #721959

# Submission time Handle Problem Language Result Execution time Memory
721959 2023-04-11T09:15:59 Z OttincaM Uplifting Excursion (BOI22_vault) C++17
20 / 100
 2720 ms 4436 KB 
#include <iostream>
#include <vector>
#include "stdio.h"
#pragma GCC optimize("Ofast,O3,unroll-loops")

using namespace std;
// #define int long long
int const LLINF = 1e9;
int const N = (10000 * 101) / 2 + 2;
 
signed main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    #ifdef WTF
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
        freopen("error.txt", "w", stderr);
    #endif
 
 
    int m;
    long long l; cin >> m >> l;
    if(l >= N || l <= -N){
        cout << "impossible\n"; return 0;
    }
    vector <int> x, y, z;
    for(int i = -m; i <= m; i ++){
         int K; cin >> K;
         while(K --){
            if(i >= 0){
                x.push_back(i);
            } else {
                y.push_back(-i);
            }
         }
    }
 
    vector <int> dp1(N, -LLINF), dp2(N, -LLINF);
    dp1[0] = 0;
    dp2[0] = 0;
    for(int k: x){
        for(int i = N - 1; i >= k; i --){
            dp1[i] = max(dp1[i], dp1[i - k] + 1);
        }
    }
 
    // for(int i = 0; i < N; i ++){
    //     cout << dp1[i] << " ";
    // }
    // cout << "\n";
 
    for(int k: y){
        for(int i = N - 1; i >= k; i --){
            dp2[i] = max(dp2[i], dp2[i - k] + 1);
        }
    }
    int ans = -LLINF;
    if(l >= 0){
        for(int i = l; i < N; i ++){
            int j = i - l;
            ans = max(ans, dp1[i] + dp2[j]);
        }
    } else {
        l = -l;
        for(int i = l; i < N; i ++){
            int j = i - l;
            ans = max(ans, dp2[i] + dp1[j]);
        }
    }
    if(ans < 0){
        cout << "impossible\n";
    } else {
        cout << ans << "\n";
    }
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4180 KB Output is correct
2 Correct 5 ms 4180 KB Output is correct
3 Correct 4 ms 4180 KB Output is correct
4 Correct 11 ms 4180 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 388 ms 4308 KB Output is correct
7 Correct 162 ms 4280 KB Output is correct
8 Correct 374 ms 4288 KB Output is correct
9 Correct 856 ms 4308 KB Output is correct
10 Correct 24 ms 4180 KB Output is correct
11 Correct 18 ms 4180 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4180 KB Output is correct
2 Correct 5 ms 4180 KB Output is correct
3 Correct 4 ms 4180 KB Output is correct
4 Correct 11 ms 4180 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 388 ms 4308 KB Output is correct
7 Correct 162 ms 4280 KB Output is correct
8 Correct 374 ms 4288 KB Output is correct
9 Correct 856 ms 4308 KB Output is correct
10 Correct 24 ms 4180 KB Output is correct
11 Correct 18 ms 4180 KB Output is correct
12 Correct 5 ms 4180 KB Output is correct
13 Correct 4 ms 4180 KB Output is correct
14 Correct 4 ms 4180 KB Output is correct
15 Correct 12 ms 4180 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 402 ms 4288 KB Output is correct
18 Correct 209 ms 4276 KB Output is correct
19 Correct 511 ms 4296 KB Output is correct
20 Correct 649 ms 4308 KB Output is correct
21 Correct 18 ms 4288 KB Output is correct
22 Correct 15 ms 4180 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1456 ms 4348 KB Output is correct
25 Correct 555 ms 4296 KB Output is correct
26 Correct 2647 ms 4436 KB Output is correct
27 Correct 2720 ms 4424 KB Output is correct
28 Correct 43 ms 4276 KB Output is correct
29 Correct 34 ms 4288 KB Output is correct

Subtask #3-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 4180 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 11 ms 4180 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 11 ms 4180 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 5 ms 4180 KB Output is correct
2 Correct 5 ms 4180 KB Output is correct
3 Correct 4 ms 4180 KB Output is correct
4 Correct 11 ms 4180 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 388 ms 4308 KB Output is correct
7 Correct 162 ms 4280 KB Output is correct
8 Correct 374 ms 4288 KB Output is correct
9 Correct 856 ms 4308 KB Output is correct
10 Correct 24 ms 4180 KB Output is correct
11 Correct 18 ms 4180 KB Output is correct
12 Correct 11 ms 4180 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 11 ms 4180 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 5 ms 4180 KB Output is correct
2 Correct 5 ms 4180 KB Output is correct
3 Correct 4 ms 4180 KB Output is correct
4 Correct 11 ms 4180 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 388 ms 4308 KB Output is correct
7 Correct 162 ms 4280 KB Output is correct
8 Correct 374 ms 4288 KB Output is correct
9 Correct 856 ms 4308 KB Output is correct
10 Correct 24 ms 4180 KB Output is correct
11 Correct 18 ms 4180 KB Output is correct
12 Correct 5 ms 4180 KB Output is correct
13 Correct 4 ms 4180 KB Output is correct
14 Correct 4 ms 4180 KB Output is correct
15 Correct 12 ms 4180 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 402 ms 4288 KB Output is correct
18 Correct 209 ms 4276 KB Output is correct
19 Correct 511 ms 4296 KB Output is correct
20 Correct 649 ms 4308 KB Output is correct
21 Correct 18 ms 4288 KB Output is correct
22 Correct 15 ms 4180 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1456 ms 4348 KB Output is correct
25 Correct 555 ms 4296 KB Output is correct
26 Correct 2647 ms 4436 KB Output is correct
27 Correct 2720 ms 4424 KB Output is correct
28 Correct 43 ms 4276 KB Output is correct
29 Correct 34 ms 4288 KB Output is correct
30 Correct 11 ms 4180 KB Output is correct
31 Incorrect 0 ms 212 KB Output isn't correct
32 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 4180 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 5 ms 4180 KB Output is correct
2 Correct 5 ms 4180 KB Output is correct
3 Correct 4 ms 4180 KB Output is correct
4 Correct 11 ms 4180 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 388 ms 4308 KB Output is correct
7 Correct 162 ms 4280 KB Output is correct
8 Correct 374 ms 4288 KB Output is correct
9 Correct 856 ms 4308 KB Output is correct
10 Correct 24 ms 4180 KB Output is correct
11 Correct 18 ms 4180 KB Output is correct
12 Correct 5 ms 4180 KB Output is correct
13 Correct 4 ms 4180 KB Output is correct
14 Correct 4 ms 4180 KB Output is correct
15 Correct 12 ms 4180 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 402 ms 4288 KB Output is correct
18 Correct 209 ms 4276 KB Output is correct
19 Correct 511 ms 4296 KB Output is correct
20 Correct 649 ms 4308 KB Output is correct
21 Correct 18 ms 4288 KB Output is correct
22 Correct 15 ms 4180 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1456 ms 4348 KB Output is correct
25 Correct 555 ms 4296 KB Output is correct
26 Correct 2647 ms 4436 KB Output is correct
27 Correct 2720 ms 4424 KB Output is correct
28 Correct 43 ms 4276 KB Output is correct
29 Correct 34 ms 4288 KB Output is correct
30 Correct 11 ms 4180 KB Output is correct
31 Incorrect 0 ms 212 KB Output isn't correct
32 Halted 0 ms 0 KB -