oj.uz

Submission #721873

# Submission time Handle Problem Language Result Execution time Memory
721873 2023-04-11T08:07:53 Z OttincaM Uplifting Excursion (BOI22_vault) C++17
5 / 100
 5000 ms 524288 KB 
#include <iostream>
#include <vector>
#include "stdio.h"
using namespace std;
#define int long long
 
long long const LLINF = 8e18;
int const N = 600000;
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);
                smn += i - 1 - m;
            } else if(i - 1 - m < 0){
                y.push_back(i - 1 - m);
                smf += i - 1 - m;
            } else {
                z.push_back(i - 1 - m);
            }
         }
    }
    if(l > smn || l < smf){
        cout << "impossible\n"; return 0;
    }
 
    vector <int> dp(N, -LLINF);
    dp[ZER] = (int)z.size();
    int mn = ZER, mx = ZER;
    for(int t: x){
        for(int i = min(N, mx + t + 1); i >= max(0LL, mn - t + 1); i--){
            if(i - t >= 0 && dp[i - t] != -LLINF){
                dp[i] = max(dp[i], dp[i - t] + 1);
                mn = min(mn, i);
                mx = max(mx, i);
            }
        }
 
    }
 
    for(int t: y){
        for(int i = max(0LL, mn + t + 1); i <= min(N, mx - t + 1); i ++){
            if(i - t < N && dp[i - t] != -LLINF){
                dp[i] = max(dp[i], dp[i - t] + 1);
                mn = min(mn, i);
                mx = max(mx, i);
            }
        }
    }
        // for(int i = 0; i < N; i ++) cout << dp[i] << " ";
 
    int ans = -LLINF;
    for(int i = 0; i < N; i ++){
        if(i - ZER == l){
            ans = dp[i]; break;
        }
    }
 
    if(ans == -LLINF){
        cout << "impossible\n";
    } else {
        cout << ans << "\n";
    }
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 185 ms 5076 KB Output is correct
7 Correct 31 ms 4948 KB Output is correct
8 Correct 173 ms 4948 KB Output is correct
9 Correct 594 ms 5076 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 4 ms 4948 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 185 ms 5076 KB Output is correct
7 Correct 31 ms 4948 KB Output is correct
8 Correct 173 ms 4948 KB Output is correct
9 Correct 594 ms 5076 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 4 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 4 ms 4948 KB Output is correct
14 Correct 3 ms 4932 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 186 ms 5076 KB Output is correct
18 Correct 32 ms 4948 KB Output is correct
19 Correct 170 ms 5076 KB Output is correct
20 Correct 590 ms 5076 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Execution timed out 5057 ms 5204 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Runtime error 409 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 2 ms 4948 KB Output is correct
2 Runtime error 409 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 2 ms 4948 KB Output is correct
2 Runtime error 409 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 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 185 ms 5076 KB Output is correct
7 Correct 31 ms 4948 KB Output is correct
8 Correct 173 ms 4948 KB Output is correct
9 Correct 594 ms 5076 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 4 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Runtime error 409 ms 524288 KB Execution killed with signal 9
14 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Runtime error 409 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 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 185 ms 5076 KB Output is correct
7 Correct 31 ms 4948 KB Output is correct
8 Correct 173 ms 4948 KB Output is correct
9 Correct 594 ms 5076 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 4 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 4 ms 4948 KB Output is correct
14 Correct 3 ms 4932 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 186 ms 5076 KB Output is correct
18 Correct 32 ms 4948 KB Output is correct
19 Correct 170 ms 5076 KB Output is correct
20 Correct 590 ms 5076 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Execution timed out 5057 ms 5204 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Runtime error 409 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 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 185 ms 5076 KB Output is correct
7 Correct 31 ms 4948 KB Output is correct
8 Correct 173 ms 4948 KB Output is correct
9 Correct 594 ms 5076 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 4 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 4 ms 4948 KB Output is correct
14 Correct 3 ms 4932 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 186 ms 5076 KB Output is correct
18 Correct 32 ms 4948 KB Output is correct
19 Correct 170 ms 5076 KB Output is correct
20 Correct 590 ms 5076 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Execution timed out 5057 ms 5204 KB Time limit exceeded
25 Halted 0 ms 0 KB -