oj.uz

Submission #721910

# Submission time Handle Problem Language Result Execution time Memory
721910 2023-04-11T08:47:03 Z OttincaM Uplifting Excursion (BOI22_vault) C++17
5 / 100
 5000 ms 4436 KB 
#include <iostream>
#include <vector>
#include "stdio.h"
using namespace std;
// #define int long long
 
long long const LLINF = 1e9 + 9;
int const N = (10000 * 101) / 2 + 9;
int const ZER = 300000;
 
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, l; cin >> m >> l;
    int smn = 0, smf = 0;
    vector <int> a(2 * m + 2), x, y, z;
    for(int i = 1; i <= 2 * m + 1; i ++){
         cin >> a[i];
         int K = a[i];
         while(K --){
            if(i - 1 - m >= 0){
                x.push_back(i - 1 - m);
            } else if(i - 1 - m < 0){
                y.push_back(-(i - 1 - m));
            } else {
                z.push_back(i - 1 - m);
            }
         }
    }
 
    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;
}

Compilation message

vault.cpp: In function 'int main()':
vault.cpp:21:9: warning: unused variable 'smn' [-Wunused-variable]
   21 |     int smn = 0, smf = 0;
      |         ^~~
vault.cpp:21:18: warning: unused variable 'smf' [-Wunused-variable]
   21 |     int smn = 0, smf = 0;
      |                  ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4180 KB Output is correct
2 Correct 6 ms 4180 KB Output is correct
3 Correct 6 ms 4180 KB Output is correct
4 Correct 28 ms 4180 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 1122 ms 4308 KB Output is correct
7 Correct 443 ms 4276 KB Output is correct
8 Correct 1049 ms 4308 KB Output is correct
9 Correct 1960 ms 4320 KB Output is correct
10 Correct 49 ms 4180 KB Output is correct
11 Correct 38 ms 4180 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4180 KB Output is correct
2 Correct 6 ms 4180 KB Output is correct
3 Correct 6 ms 4180 KB Output is correct
4 Correct 28 ms 4180 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 1122 ms 4308 KB Output is correct
7 Correct 443 ms 4276 KB Output is correct
8 Correct 1049 ms 4308 KB Output is correct
9 Correct 1960 ms 4320 KB Output is correct
10 Correct 49 ms 4180 KB Output is correct
11 Correct 38 ms 4180 KB Output is correct
12 Correct 8 ms 4180 KB Output is correct
13 Correct 7 ms 4180 KB Output is correct
14 Correct 5 ms 4180 KB Output is correct
15 Correct 28 ms 4180 KB Output is correct
16 Correct 3 ms 4180 KB Output is correct
17 Correct 1123 ms 4308 KB Output is correct
18 Correct 445 ms 4280 KB Output is correct
19 Correct 1082 ms 4288 KB Output is correct
20 Correct 2005 ms 4312 KB Output is correct
21 Correct 51 ms 4180 KB Output is correct
22 Correct 38 ms 4272 KB Output is correct
23 Correct 2 ms 4180 KB Output is correct
24 Correct 4362 ms 4348 KB Output is correct
25 Correct 1543 ms 4308 KB Output is correct
26 Execution timed out 5051 ms 4436 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 4180 KB Output is correct
2 Incorrect 2 ms 4180 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 30 ms 4180 KB Output is correct
2 Incorrect 2 ms 4180 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 30 ms 4180 KB Output is correct
2 Incorrect 2 ms 4180 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 8 ms 4180 KB Output is correct
2 Correct 6 ms 4180 KB Output is correct
3 Correct 6 ms 4180 KB Output is correct
4 Correct 28 ms 4180 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 1122 ms 4308 KB Output is correct
7 Correct 443 ms 4276 KB Output is correct
8 Correct 1049 ms 4308 KB Output is correct
9 Correct 1960 ms 4320 KB Output is correct
10 Correct 49 ms 4180 KB Output is correct
11 Correct 38 ms 4180 KB Output is correct
12 Correct 30 ms 4180 KB Output is correct
13 Incorrect 2 ms 4180 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 30 ms 4180 KB Output is correct
2 Incorrect 2 ms 4180 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 8 ms 4180 KB Output is correct
2 Correct 6 ms 4180 KB Output is correct
3 Correct 6 ms 4180 KB Output is correct
4 Correct 28 ms 4180 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 1122 ms 4308 KB Output is correct
7 Correct 443 ms 4276 KB Output is correct
8 Correct 1049 ms 4308 KB Output is correct
9 Correct 1960 ms 4320 KB Output is correct
10 Correct 49 ms 4180 KB Output is correct
11 Correct 38 ms 4180 KB Output is correct
12 Correct 8 ms 4180 KB Output is correct
13 Correct 7 ms 4180 KB Output is correct
14 Correct 5 ms 4180 KB Output is correct
15 Correct 28 ms 4180 KB Output is correct
16 Correct 3 ms 4180 KB Output is correct
17 Correct 1123 ms 4308 KB Output is correct
18 Correct 445 ms 4280 KB Output is correct
19 Correct 1082 ms 4288 KB Output is correct
20 Correct 2005 ms 4312 KB Output is correct
21 Correct 51 ms 4180 KB Output is correct
22 Correct 38 ms 4272 KB Output is correct
23 Correct 2 ms 4180 KB Output is correct
24 Correct 4362 ms 4348 KB Output is correct
25 Correct 1543 ms 4308 KB Output is correct
26 Execution timed out 5051 ms 4436 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 4180 KB Output is correct
2 Incorrect 2 ms 4180 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 8 ms 4180 KB Output is correct
2 Correct 6 ms 4180 KB Output is correct
3 Correct 6 ms 4180 KB Output is correct
4 Correct 28 ms 4180 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 1122 ms 4308 KB Output is correct
7 Correct 443 ms 4276 KB Output is correct
8 Correct 1049 ms 4308 KB Output is correct
9 Correct 1960 ms 4320 KB Output is correct
10 Correct 49 ms 4180 KB Output is correct
11 Correct 38 ms 4180 KB Output is correct
12 Correct 8 ms 4180 KB Output is correct
13 Correct 7 ms 4180 KB Output is correct
14 Correct 5 ms 4180 KB Output is correct
15 Correct 28 ms 4180 KB Output is correct
16 Correct 3 ms 4180 KB Output is correct
17 Correct 1123 ms 4308 KB Output is correct
18 Correct 445 ms 4280 KB Output is correct
19 Correct 1082 ms 4288 KB Output is correct
20 Correct 2005 ms 4312 KB Output is correct
21 Correct 51 ms 4180 KB Output is correct
22 Correct 38 ms 4272 KB Output is correct
23 Correct 2 ms 4180 KB Output is correct
24 Correct 4362 ms 4348 KB Output is correct
25 Correct 1543 ms 4308 KB Output is correct
26 Execution timed out 5051 ms 4436 KB Time limit exceeded
27 Halted 0 ms 0 KB -