oj.uz

Submission #595594

# Submission time Handle Problem Language Result Execution time Memory
595594 2022-07-13T20:54:30 Z ThegeekKnight16 Uplifting Excursion (BOI22_vault) C++14
0 / 100
 2638 ms 12948 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
map<ll, ll> dp;
ll border = 1e5 + 10;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    for (int i = -border; i <= border; i++) dp[i] = -1e18 - 10;
    dp[0] = 0;
    
    ll M, L;
    cin >> M >> L;
    for (ll i = -M; i <= M; i++)
    {
        ll A;
        cin >> A;
        int c = 1;
        if (i < 0) c = -1;
        //cerr << c << '\n';
        for (int t = c*border; abs(t) <= border; t -= c)
        {
            for (ll k = 1; k <= A; k++) dp[t] = max(dp[t], dp[t - (i * k)] + k);
            
        }
    }
    
    //for (int i = -6; i <= 6; i++) cerr << dp[i] << " ";
    
    if (dp[L] <= -1e15 - 10) cout << "impossible";
    else cout << dp[L];
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 554 ms 12820 KB Output is correct
2 Correct 424 ms 12820 KB Output is correct
3 Correct 317 ms 12832 KB Output is correct
4 Incorrect 2631 ms 12832 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 554 ms 12820 KB Output is correct
2 Correct 424 ms 12820 KB Output is correct
3 Correct 317 ms 12832 KB Output is correct
4 Incorrect 2631 ms 12832 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2638 ms 12948 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2638 ms 12948 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2638 ms 12948 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 554 ms 12820 KB Output is correct
2 Correct 424 ms 12820 KB Output is correct
3 Correct 317 ms 12832 KB Output is correct
4 Incorrect 2631 ms 12832 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2638 ms 12948 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 554 ms 12820 KB Output is correct
2 Correct 424 ms 12820 KB Output is correct
3 Correct 317 ms 12832 KB Output is correct
4 Incorrect 2631 ms 12832 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2638 ms 12948 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 554 ms 12820 KB Output is correct
2 Correct 424 ms 12820 KB Output is correct
3 Correct 317 ms 12832 KB Output is correct
4 Incorrect 2631 ms 12832 KB Output isn't correct
5 Halted 0 ms 0 KB -