oj.uz

답안 #721805

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
721805 2023-04-11T07:28:43 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 = 800000;
int const ZER = 400000;

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;
    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> dp(N, -LLINF);
    dp[ZER] = (int)z.size();

    for(int t: x){
        for(int i = N - 1; i >= 0; i--){
            if(i - t >= 0 && dp[i - t] != -LLINF){
                dp[i] = max(dp[i], dp[i - t] + 1);
            }
        }

    }

    for(int t: y){
        for(int i = 0; i < N; i ++){
            if(i - t < N && dp[i - t] != -LLINF){
                dp[i] = max(dp[i], dp[i - t] + 1);
            }
        }
    }
        // 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

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 6484 KB Output is correct
2 Correct 11 ms 6484 KB Output is correct
3 Correct 8 ms 6492 KB Output is correct
4 Correct 35 ms 6484 KB Output is correct
5 Correct 1821 ms 6612 KB Output is correct
6 Correct 1875 ms 6612 KB Output is correct
7 Correct 787 ms 6612 KB Output is correct
8 Correct 2033 ms 6612 KB Output is correct
9 Correct 3585 ms 6612 KB Output is correct
10 Correct 61 ms 6484 KB Output is correct
11 Correct 63 ms 6508 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 6484 KB Output is correct
2 Correct 11 ms 6484 KB Output is correct
3 Correct 8 ms 6492 KB Output is correct
4 Correct 35 ms 6484 KB Output is correct
5 Correct 1821 ms 6612 KB Output is correct
6 Correct 1875 ms 6612 KB Output is correct
7 Correct 787 ms 6612 KB Output is correct
8 Correct 2033 ms 6612 KB Output is correct
9 Correct 3585 ms 6612 KB Output is correct
10 Correct 61 ms 6484 KB Output is correct
11 Correct 63 ms 6508 KB Output is correct
12 Correct 10 ms 6484 KB Output is correct
13 Correct 7 ms 6484 KB Output is correct
14 Correct 6 ms 6484 KB Output is correct
15 Correct 37 ms 6484 KB Output is correct
16 Correct 1822 ms 6612 KB Output is correct
17 Correct 1916 ms 6612 KB Output is correct
18 Correct 745 ms 6484 KB Output is correct
19 Correct 1951 ms 6612 KB Output is correct
20 Correct 3556 ms 6612 KB Output is correct
21 Correct 60 ms 6484 KB Output is correct
22 Correct 69 ms 6484 KB Output is correct
23 Execution timed out 5084 ms 6752 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 6484 KB Output is correct
2 Runtime error 444 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 6484 KB Output is correct
2 Runtime error 444 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 6484 KB Output is correct
2 Runtime error 444 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 6484 KB Output is correct
2 Correct 11 ms 6484 KB Output is correct
3 Correct 8 ms 6492 KB Output is correct
4 Correct 35 ms 6484 KB Output is correct
5 Correct 1821 ms 6612 KB Output is correct
6 Correct 1875 ms 6612 KB Output is correct
7 Correct 787 ms 6612 KB Output is correct
8 Correct 2033 ms 6612 KB Output is correct
9 Correct 3585 ms 6612 KB Output is correct
10 Correct 61 ms 6484 KB Output is correct
11 Correct 63 ms 6508 KB Output is correct
12 Correct 54 ms 6484 KB Output is correct
13 Runtime error 444 ms 524288 KB Execution killed with signal 9
14 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 6484 KB Output is correct
2 Runtime error 444 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 6484 KB Output is correct
2 Correct 11 ms 6484 KB Output is correct
3 Correct 8 ms 6492 KB Output is correct
4 Correct 35 ms 6484 KB Output is correct
5 Correct 1821 ms 6612 KB Output is correct
6 Correct 1875 ms 6612 KB Output is correct
7 Correct 787 ms 6612 KB Output is correct
8 Correct 2033 ms 6612 KB Output is correct
9 Correct 3585 ms 6612 KB Output is correct
10 Correct 61 ms 6484 KB Output is correct
11 Correct 63 ms 6508 KB Output is correct
12 Correct 10 ms 6484 KB Output is correct
13 Correct 7 ms 6484 KB Output is correct
14 Correct 6 ms 6484 KB Output is correct
15 Correct 37 ms 6484 KB Output is correct
16 Correct 1822 ms 6612 KB Output is correct
17 Correct 1916 ms 6612 KB Output is correct
18 Correct 745 ms 6484 KB Output is correct
19 Correct 1951 ms 6612 KB Output is correct
20 Correct 3556 ms 6612 KB Output is correct
21 Correct 60 ms 6484 KB Output is correct
22 Correct 69 ms 6484 KB Output is correct
23 Execution timed out 5084 ms 6752 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 6484 KB Output is correct
2 Runtime error 444 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 6484 KB Output is correct
2 Correct 11 ms 6484 KB Output is correct
3 Correct 8 ms 6492 KB Output is correct
4 Correct 35 ms 6484 KB Output is correct
5 Correct 1821 ms 6612 KB Output is correct
6 Correct 1875 ms 6612 KB Output is correct
7 Correct 787 ms 6612 KB Output is correct
8 Correct 2033 ms 6612 KB Output is correct
9 Correct 3585 ms 6612 KB Output is correct
10 Correct 61 ms 6484 KB Output is correct
11 Correct 63 ms 6508 KB Output is correct
12 Correct 10 ms 6484 KB Output is correct
13 Correct 7 ms 6484 KB Output is correct
14 Correct 6 ms 6484 KB Output is correct
15 Correct 37 ms 6484 KB Output is correct
16 Correct 1822 ms 6612 KB Output is correct
17 Correct 1916 ms 6612 KB Output is correct
18 Correct 745 ms 6484 KB Output is correct
19 Correct 1951 ms 6612 KB Output is correct
20 Correct 3556 ms 6612 KB Output is correct
21 Correct 60 ms 6484 KB Output is correct
22 Correct 69 ms 6484 KB Output is correct
23 Execution timed out 5084 ms 6752 KB Time limit exceeded
24 Halted 0 ms 0 KB -