oj.uz

답안 #721806

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
721806 2023-04-11T07:29:28 Z OttincaM Uplifting Excursion (BOI22_vault) C++17
0 / 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 = 2000000;
int const ZER = 1000000;

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
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 15956 KB Output is correct
2 Correct 23 ms 15956 KB Output is correct
3 Correct 17 ms 15980 KB Output is correct
4 Correct 93 ms 15956 KB Output is correct
5 Correct 4793 ms 15956 KB Output is correct
6 Execution timed out 5025 ms 15956 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 15956 KB Output is correct
2 Correct 23 ms 15956 KB Output is correct
3 Correct 17 ms 15980 KB Output is correct
4 Correct 93 ms 15956 KB Output is correct
5 Correct 4793 ms 15956 KB Output is correct
6 Execution timed out 5025 ms 15956 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

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

Subtask #3-2
0 / 10.0

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

Subtask #4-1
0 / 10.0

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

Subtask #4-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 15956 KB Output is correct
2 Correct 23 ms 15956 KB Output is correct
3 Correct 17 ms 15980 KB Output is correct
4 Correct 93 ms 15956 KB Output is correct
5 Correct 4793 ms 15956 KB Output is correct
6 Execution timed out 5025 ms 15956 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

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

Subtask #5-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 15956 KB Output is correct
2 Correct 23 ms 15956 KB Output is correct
3 Correct 17 ms 15980 KB Output is correct
4 Correct 93 ms 15956 KB Output is correct
5 Correct 4793 ms 15956 KB Output is correct
6 Execution timed out 5025 ms 15956 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

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

Subtask #6-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 15956 KB Output is correct
2 Correct 23 ms 15956 KB Output is correct
3 Correct 17 ms 15980 KB Output is correct
4 Correct 93 ms 15956 KB Output is correct
5 Correct 4793 ms 15956 KB Output is correct
6 Execution timed out 5025 ms 15956 KB Time limit exceeded
7 Halted 0 ms 0 KB -